Bitwise Tour

Given a rooted tree with $N$ vertices labeled $1$ through $N$, the root being $1$ and each node containing a value $A_i$, you're to process $Q$ queries of the following type(s): - $1\ u\ w$: Update the value of node **u** to **w**. - $2\ u$: Print the absolute difference $|AND(u) - OR(T - u)|$, where $AND(u)$ is bitwise AND of all node values in the subtree rooted at node **u**, and $OR(T - u)