Question about trees, please help!

Given a tree and many queries, each query consists of an integer X, which means that you need to find a vertex Y, in the subtree of X, such that 2*subtree_size(Y) >= subtree_size(X) and subtree_size(Y) is minimum over all the candidate answers which follow the above property.

//