B'This is the easy version of the problem. The only difference is the limit on the number of queries. This is an interactive problem. You are given a tree of n nodes with node 1 as its root node. There is a hidden mole in one of the nodes. To find its position, you can pick an integer x ( 1 <= x <= n ) to make an inquiry to the jury. Next, the jury will return 1 when the mole is in subtree x . Otherwise, the judge will return 0 . If the judge returns 0 and the mole is not in root node 1 , the mole will move to the parent node of the node it is currently on. Use at most 300 operations to find the current node where the mole is located. Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 100 ). The description of the test cases follows. The first line of each test case contains one integer n ( 2 <= n <= 5000 ). The following n-1 lines describe the edges of the tree. Each line contains two space-separated integers u_i and v_i ( 1 <= u_i, v_i <= n ), indicating an edge between nodes u_i and v_i . It is guaranteed that the input data represents a tree. The interactor in this task is not adaptive. In other words, the node where the mole is located at first is fixed in every test case and does not change during the interaction. To ask a query, you need to pick a vertex x ( 1 <= x <= n ) and print the line of the following form: After that, you receive: You can make at most 300 queries of this form for each test case. Next, if your program has found the current node where the mole is located, print the line of the following form: Note that this line is not considered a query and is not taken into account when counting the number of queries asked. After this, proceed to the next test case. If you make more than 300 queries during an interaction, your program must terminate immed'...