SP11985 GOT - Gao on a tree

There's a tree, with each vertex assigned a number. For each query (a, b, c), you are asked whether there is a vertex on the path from a to b, which is assigned number c?

There are multiple cases, end by EOF. For each case, the first line contains n (n

You should output "`Find`" or "`NotFind`" for every query on one line. Output a blank line AFTER every case.