Tree Query

You are given a tree with $N$ vertices (numbered $1$ through $N$); vertex $1$ is the root. Initially, for each valid $i$, the $i$-th vertex has a weight $w_i$. You should perform a sequence of $Q$ operations of the following two types: 1. Add $x$ to the weight of vertex $v$. 2. Add $x$ to the weight of each vertex in the subtree of vertex $v$ (including $v$). Let's define a function $f(u) = \