Power Tree

You are given a tree containing $N$ nodes numbered from $1$ to $N$ such that the $i^{th}$ node has a value $A_i$ assigned to it. The root of the tree is node $1$. The *power* of each node is the **maximum** value assigned to any node present in the *subtree* of the node. You are given an integer $X$. Your task is to make the **sum** of the *powers* of **all** the nodes of the tree **greater t