The equipartition problem on an undirected graph G=(V,E) with n nodes and a system of edge weights, is to find a subset of [n/2] nodes such as the associate cut has a smallest cost. We present a polynomial algorithm to solve the equipartition problem on a tree.