In-tree-active Node Coloring

**This is an interactive problem.** You are given a tree having $N$ nodes. Each node of this tree is colored either Black or White but you don't know the initial color of any node. You can ask up to $Q$ queries. In each query, you will give a node to the grader. The grader will flip the color of this node and then return the number of edges in the tree connecting nodes of different colors. Note