func_code_string: #include <bits/stdc++.h>   long long R = 7 + 1e9, NUMTESTCASE;   const int NN = 10 + 2e6;   const double pi = acos(-1.0);   int di[4] = {1, 0, -1, 0}, dj[4] = {0, 1, 0, -1},       DI[8] = {1, 1, 0, -1, -1, -1, 0, 1}, DJ[8] = {0, 1, 1, 1, 0, -1, -1, -1};   using namespace std;   int n, ti = 1, timein[NN], timeout[NN], lev[NN], parn[NN], Hash[NN], m,          segtree[NN];   vector<int> G[NN];   void DFS(int ver, int par, int cnt) {     int in = ti++;     for (int u : G[ver])       if (u != par) DFS(u, ver, cnt + 1);     Hash[ver] = ++m;     lev[Hash[ver]] = cnt;     parn[Hash[ver]] = par;     timein[Hash[ver]] = in;     timeout[Hash[ver]] = ti++;   }   bool isgra(int ver, int par) {     return (timein[par] <= timein[ver] && timeout[par] >= timeout[ver]);   }   unordered_map<int, unordered_map<int, int> > memo;   int com_par(int u, int v) {     if (isgra(v, u)) return u;     if (isgra(u, v)) return v;     auto it1 = memo.find(u);     if (it1 != memo.end()) {       auto it2 = it1->second.find(v);       if (it2 != it1->second.end()) return it2->second;     }     return memo[u][v] = memo[v][u] = com_par(u, parn[v]);   }   void build(int pos, int st, int en) {     if (st == en) {       segtree[pos] = st;       return;     }     build(2 * pos, st, (st + en) / 2);     build(2 * pos + 1, (st + en) / 2 + 1, en);     segtree[pos] = com_par(segtree[2 * pos], segtree[2 * pos + 1]);   }   int seg_com_par(int pos, int st, int en, int u, int v) {     if (en < u || st > v) return -1;     if (st >= u && en <= v) return segtree[pos];     int flag1 = seg_com_par(2 * pos, st, (st + en) / 2, u, v);     int flag2 = seg_com_par(2 * pos + 1, (st + en) / 2 + 1, en, u, v);     int res;     if (flag1 != -1 && flag2 != -1)       res = com_par(flag1, flag2);     else if (flag1 != -1)       res = flag1;     else       res = flag2;     return res;   }   int dis(int v, int u) {     if (u > v) swap(u, v);     return lev[v] + lev[u] - 2 * lev[seg_com_par(1, 1, m, u, v)];   }   int main() {     cin >> n;     int u, v;     for (int i = (1); i <= (n - 1); ++i) {       scanf( %d%d , &u, &v);       G[u].push_back(v);       G[v].push_back(u);     }     DFS(1, -1, 0);     parn[Hash[1]] = 1;     for (int i = (1); i <= (n); ++i) parn[i] = Hash[parn[i]];     build(1, 1, m);     int x, y, a, b, k, q;     cin >> q;     while (q--) {       scanf( %d%d%d%d%d , &x, &y, &a, &b, &k);       x = Hash[x];       y = Hash[y];       a = Hash[a];       b = Hash[b];       int flag = 0, ab = dis(a, b), axyb = 1 + dis(a, x) + dis(y, b),           ayxb = 1 + dis(a, y) + dis(x, b);       if (ab % 2 == k % 2 && ab <= k) flag = 1;       if (axyb % 2 == k % 2 && axyb <= k) flag = 1;       if (ayxb % 2 == k % 2 && ayxb <= k) flag = 1;       printf(flag ?  YES n  :  NO n );     }     return 0;   }   