Collision

Problem Description

Siyisss's kingdom consists of $n$ villages and $n - 1$ bidirectional roads. The villages are numbered from $1$ to $n$, and each bidirectional road connects two different villages, such that one can reach any village from any other village. Then you are to answer $q$ queries. Each query gives two integers $c, d$, meaning that there is currently one person at village $c$ and one person at village $d$. The person at $c$ wants to reach village $d$ in the shortest possible time, and the person at $d$ wants to reach village $c$ in the shortest possible time. Suppose the two start at the same time, move at the same speed, and every bidirectional road has the same length. When they meet, are they at some village, or on some bidirectional road?

Input Format

The first line contains two integers $n, q$, the number of villages and the number of queries.

The next $n - 1$ lines each contain two integers describing one bidirectional road.

The last $q$ lines each contain two integers $c, d$.

Output Format

For each query, if they meet at some village, output Town; otherwise output Road.

Sample Input 1

5 2
1 2
2 3
3 4
4 5
1 3
1 5

Sample Output 1

Town
Town

Sample Input 2

9 9
2 3
5 6
4 8
8 9
4 5
3 4
1 9
3 7
7 9
2 5
2 6
4 6
2 4
5 8
7 8
3 6
5 6

Sample Output 2

Town
Road
Town
Town
Town
Town
Road
Road
Road

Constraints

$2 \leq n \leq 100000$

$1 \leq q \leq 100000$

For each query $1 \leq c_i < d_i \leq n$.