B'Eikooc and Sushi play a game. The game is played on a tree having n nodes numbered 1 to n . Recall that a tree having n nodes is an undirected, connected graph with n-1 edges. They take turns alternately moving a token on the tree. Eikooc makes the first move, placing the token on any node of her choice. Sushi makes the next move, followed by Eikooc, followed by Sushi, and so on. In each turn after the first, a player must move the token to a node u such that Here x oplus y denotes the bitwise XOR operation on integers x and y . Both the players play optimally. The player who is unable to make a move loses. The following are examples which demonstrate the rules of the game. Before the game begins, Eikooc decides to sneakily relabel the nodes of the tree in her favour. Formally, a relabeling is a permutation p of length n (sequence of n integers wherein each integer from 1 to n occurs exactly once) where p_i denotes the new numbering of node i . She wants to maximize the number of nodes she can choose in the first turn which will guarantee her a win. Help Eikooc find any relabeling which will help her do so. The first line contains a single integer t~(1 <= t <= 10^5) -- the number of test cases. The description of each test case is as follows. The first line of each test case contains an integer n~(1 <= n <= 2 cdot 10^5) -- the number of nodes in the tree. The next n-1 lines contain two integers u and v (1 <= u, v <= n; u neq v) -- denoting an edge between nodes u and v . It is guaranteed that the sum of n over all test cases does not exceed 2 cdot 10^5 . For each test case print any suitable relabeling -- a permutation of length n which maximizes the number of nodes that can be chosen in the first turn that guarantee a win for Eikooc. If there are multiple such relabelings, you'...