The TREEt is one problem away!

Given a tree of $N$ nodes rooted at $1$, where each node i ∈ [$1,N$] has a value $A_i$ associated with it. There are $Q$ queries given, and each query can be one of the following two types: $1$ $X$ $Y$ => Increase the values of all nodes in the subtree of $X$ (including $X$) by $Y$. $2$ $X$ => Find number of values in the subtree of $X$ (including $X$) which are odd. P.S. - Problem was too har