Beautiful Sum

You are given a rooted tree of $N$ nodes, where node $1$ is the root. The $i$-th edge has weight $w_i$ and connects nodes $u_i$ and $v_i$. You have to process $Q$ queries of two types: - $1 \, u \, x$ : For every edge in the subtree of node $u$, update its weight by applying the bitwise XOR with $x$, i.e., $w_i \gets w_i \oplus x$. - $2 \, u$ : Compute the sum of **beauty** for all possible unord