House of Queries

You are given a connected tree rooted at **$1$**. Each node has an integer value **$A$i** associated with it. You need to process **$Q$** queries. The queries can be of the following two types :- Type1 : **`1 X Y`**, Change the value at node $X$ to $Y$, i.e. **$A$X$ = Y$**. Type2 : **`2 X D`**, Output the sum of all nodes at a distance $D$ from node $X$ which are in the subtree of $X$. If ther