Chef Graph

You have an undirected complete graph with $N$ nodes, numbered from $1$ to $N$. The Value of a simple path in this graph, say $(u_1, u_2, \ldots, u_k)$, is the [Bitwise XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) of all the node numbers. That is, the Value is equal to $u_1 \oplus u_2 \oplus \ldots \oplus u_k$. You are given $Q$ queries in the form of $u$ and $v$. Chef asks you to