Nuttela Path Unit

You’re given a tree with $N$ nodes (where each node $i$ has a value $A_i$) and $Q$ queries in the form $u$ $v$. The answer to each query is the XOR of value of nodes on the shortest path from node $u$ to $v$. ### Input - First line will contains a single integer $T$, number of test cases. - First line of each test case contains two space-separated integers - $N$ and $Q$ - Second line of each