This paper investigated a tree partition problem that arises in parallel and distributed computing environments. It gave a tree with vertex and edge weights， partitioning into vertex-disjoint subtrees by cutting some edges such that the sum of vertex (nod
