You are given a tree with nodes, numbered from 1 to . Each node has an integer value .
You can perform at most operations. In one operation, you may pick a leaf node and reattach it to any ancestor of its current parent.
After all operations, define as the sum of values in the subtree rooted at node . Your goal is to minimize the total sum:



