Tree Query

You are given a [tree](https://en.wikipedia.org/wiki/Tree_(graph_theory)) with $N$ vertices rooted at vertex $1$, where $ith$ vertex having a value $A_i$. You are also given $Q$ queries where each query gives you a node $u$ and a value $val$. You need to add $val$ to each node $v$ such that $v$ is in the subtree of $u$ ###Input: - First line will contain $N$ and $Q$, number of nodes and queries