You are given a tree with nodes, numbered from 1 to n. Each node has an integer value .

You can perform at most k operations. In one operation, you may pick a leaf node and reattach it to any node.

After all operations, define Xi as the sum of values in the subtree rooted at node i . Your goal is to minimize sum of All Xi.