Paired Tree

You are given a tree containing $2N$ vertices and $2N-1$ undirected edges. Vertex $u$ has the color $A_u$. It is guaranteed that each color from $1$ to $N$ appears **exactly twice** in the tree. Process $Q$ queries of two type on this tree: - $1 \ \ u \ \ v$: Swap the colors on vertices $u$ and $v$, i.e, swap $A_u$ and $A_v$. - $2\ \ k$: Let $u$ and $v$ be the two vertices colored $k$. Sup