B"There is a directed graph on n vertices numbered 1 through n where each vertex (except n ) has two outgoing arcs, red and blue. At any point in time, exactly one of the arcs is active for each vertex. Initially, all blue arcs are active and there is a token located at vertex 1 . In one second, the vertex with token first switches its active arcs -- the inactive arc becomes active and vice versa. Then, the token is moved along the active arc. When the token reaches the vertex n , it stops. It is guaranteed that n is reachable via arcs from every vertex. You are given q queries. Each query contains a state of the graph -- a pair (v, s) of the following form: For each query, determine whether the given state is reachable from the initial state and the first time this configuration appears. Note that the two operations (change active arc and traverse it) are atomic -- a state is not considered reached if it appears after changing the active arc but before traversing it. The first line contains a single integer n ( 2 <= q n <= q 58 ) -- the number of vertices. n-1 lines follow, i -th of contains two space separated integers b_i and r_i ( 1 <= q b_i, r_i <= q n ) representing a blue arc (i, b_i) and red arc (i, r_i) , respectively. It is guaranteed that vertex n is reachable from every vertex. The next line contains a single integer q ( 1 <= q q <= q 5000 ) -- the number of queries. Then q lines with queries follow. The j -th of these lines contains an integer v ( 1 <= q v < n ) and a string s of length n-1 consiting only of characters 'R' and 'B'. The i -th of these characters is 'R' if the red arc going from i is active and 'B' otherwise. Output q lines, each containing answer to a single query. If the state in the i -th query is unreachable, output the integer -1 . Otherwise, out"...