Candy Delivery

The village where Yunjae lives has $N$ candy stores. The stores are numbered from $1$ to $N$. Each store sells only one of five kinds of candy. There is also a road network of $N-1$ roads connecting the candy stores. Every road takes $1$ unit of time to traverse, and using the roads one can travel from any candy store to every other candy store.

Today Yunjae plans to meet $M$ friends one at a time, in order. On the way to meet each friend, he must buy the kind of candy that friend likes. If he fails, the friend gets angry and leaves.

To meet his friends quickly, Yunjae sets off for the next friend immediately after meeting one friend. To save as much time as possible, he always travels along a shortest path, and along the way he stops at candy stores he passes and buys candy there. He may also buy candy at a store located where the friend is. However, his pockets are small, so he can carry only one candy at a time. That is, while on the way to meet some friend A, he cannot buy a candy for another friend B in advance.

To find out in advance which friends will leave him, Yunjae wants to know whether he can buy candy for each friend. Yunjae may choose his starting location freely. Write a program that helps Yunjae determine, for each friend, whether he can buy the kind of candy that friend likes.

The first line gives an integer $N$, the number of candy stores. ($1 \leq N \leq 100\ 000$)

The second line gives $N$ integers separated by spaces, indicating the kind of candy sold at each candy store. A candy kind is a positive integer between $1$ and $5$.

From the third line, $N-1$ lines give road information as pairs $u, v$. This means there is a bidirectional road connecting candy store $u$ and candy store $v$. ($1 \leq u, v \leq N$, $u \neq v$)

The next line gives an integer $M$, the number of friends. ($1 \leq M \leq 100\ 000$)

The next $M$ lines give, in order of earliest appointment time, the number of the store where each friend stands and the kind of candy that friend likes. Several friends may stand in front of the same store.

In order of earliest appointment time, print PLAY on its own line if Yunjae can buy the kind of candy that friend likes, and CRY otherwise.