Chef and Bit Tree

*This problem has subtasks.* Chef has a tree of $N$ vertices. Vertex $i$ has the corresponding value $A_i$. As a close friend of the chef, he has entrusted you with the task of handling $Q$ queries on the tree during your pastime. These queries can be of two types: - Type $1$: Given two integers $u$ and $x$, set the value of vertex $u$ to $x$. More formally, set $A_u$ to $x$. - Type $2$: Given