Chef Queries

We have a tree with $N$ nodes numbered $1$ through $N$. The $i^{th}$ node has a value $A_i$ associated to it. You are given $Q$ queries of the following type: - Given integers $X, Y, L,$ and $R$, find whether there exists a set of nodes $S$ such that $\forall u \in S$: - $D(u,X) \lt L$ **or** $D(u, X) \gt R$, where $D(a, b)$ denotes the number of edges on a simple path between nodes $a$ and $