Trees Are Fun

You are given a tree with $N$ nodes (numbered $1$ to $N$) rooted at node $1$. Node $i$ has value $A_i(1 \leq A_u \leq 10^9)$ associated to it. You will receive $Q$ queries, each containing two nodes $u$ and $v$. For each query: - First swap values $A_u$ and $A_v$ ; - Suppose $P_x$ denotes the array containing the values of all nodes in the subtree of $x$ (including node $x$) in non-decreasing o