Alice and Bob are playing a game on an undirected Tree. Alice plays first. In first move, Alice can mark any vertex of the tree. After first move, they will play alternatively and each player will choose a vertex which is adjacent to the LAST marked vertex and mark it. Note that a player cannot mark a vertex which was already marked in a previous move. If a player can not choose any vertex, he or she loses. Given that both players play optimally, can you find out who will win, even before the game begins. \InputFile First line contains \textbf{T}, the number of test cases. Then description of each test case follows. First line contains a number \textbf{N}, the number of vertices in a tree. The next \textbf{N}-\textbf{1} lines contains two space separated integers \textbf{a} \textbf{b} represents an undirected edge from \textbf{a} to \textbf{b}. (\textbf{1} ≤ \textbf{a}, \textbf{b} ≤ \textbf{N}). It is known that \textbf{T} ≤ \textbf{25}, \textbf{N} ≤ \textbf{50000}. \OutputFile Output \textbf{T} lines, each containing the answer for one test case. Output "\textbf{Alice}" if Alice wins the game, or "\textbf{Bob}" otherwise. \[quotes for clarity only\].