Tree query - 3

You are given a tree consisting of \(N\) nodes. You have to answer \(Q\) queries. In each query, you have to find whether there is a node \(Y\) in distance >= \(K\) from node \(X\).

Input Format

The first line contains an integer \(N\) denotes the number of nodes. The next \(N - 1\) line contains \(2\) space-separated integers denoting the connection between nodes. The next line contains \(Q\). Each of the next \(Q\) lines contain two space-separated integers \(X\) and \(K\).

Output Format

If there is a node, print “YES” else print “NO”.

Constraints

\(2 \le N \le 10 ^ 5\)
\(0 \lt Q \le 10 ^ 5\)
\(0 \lt K \lt N\)

Sample Input 0

4
0 1
1 2
2 3
4
0 2
0 3
3 3
1 3

Sample Output 0

YES
YES
YES
NO