Node Marking

You are given an integer $K$ and a tree of size $N$, rooted at node $1$. In one operation, you can either select a node of the tree and color its entire subtree or create a new (uncolored) copy of the given tree. Find the minimum number of operations required so that the total number of colored nodes among all trees is exactly $K$. ###Input - The first line contains an integer $T$, denoting the