Move the Coins - Creating Tests

Chef is preparing tests for the problem ["Move the Coins"](https://www.hackerrank.com/challenges/move-the-coins/problem)! He needs to create a tree $G$ with $N$ nodes (numbered $1$ through $N$), which is rooted at node $1$, and a list of $Q$ distinct *reparentings*. A reparenting is a pair of nodes $(u, v)$ ($u \neq 1$) of $G$ and the result of applying it to $G$ is another graph, formed as fol