#include <bits/stdc++.h>
using namespace std;
long long t, n, m, k, a, b, c, tmp, ans, xx, yy, gg[200005], root[200005],
    rt[200005], anx[200005], any[200005], dep[600000], jp[600000][50];
vector<int> ee[200005];
priority_queue<int> q, qq;
void jpp(int first, int fa) {
  int ii;
  gg[first] = 1;
  dep[first] = dep[fa] + 1;
  for (int ii = 1; ii <= 20; ii++) {
    jp[first][ii] = jp[jp[first][ii - 1]][ii - 1];
  }
  for (int ii = 0; ii < ee[first].size(); ii++)
    if (ee[first][ii] != fa) {
      jp[ee[first][ii]][0] = first;
      jpp(ee[first][ii], first);
    }
}
int lca(int first, int second) {
  int cost = 0, ii;
  if (dep[first] < dep[second]) swap(first, second);
  for (int ii = 20; ii >= 0; ii--) {
    if (dep[jp[first][ii]] >= dep[second]) {
      cost += (1 << ii);
      first = jp[first][ii];
    }
    if (first == second) return cost;
  }
  for (int ii = 20; ii >= 0; ii--) {
    if (jp[first][ii] != jp[second][ii]) {
      cost += (1 << ii) * 2;
      first = jp[first][ii];
      second = jp[second][ii];
    }
  }
  return cost + 2;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n - 1; i++) {
    scanf("%d%d", &a, &b);
    ee[a].push_back(b);
    ee[b].push_back(a);
  }
  for (int i = 1; i <= n; i++)
    if (ee[i].size() == 1 && gg[i] == 0) {
      jpp(i, i);
    }
  scanf("%d", &m);
  for (int i = 0; i < m; i++) {
    scanf("%d%d%d%d%d", &xx, &yy, &a, &b, &c);
    ans = 0;
    tmp = lca(a, b);
    if (tmp <= c && (c - tmp) % 2 == 0) ans = 1;
    tmp = lca(a, xx) + lca(yy, b) + 1;
    if (tmp <= c && (c - tmp) % 2 == 0) ans = 1;
    tmp = lca(a, yy) + lca(xx, b) + 1;
    if (tmp <= c && (c - tmp) % 2 == 0) ans = 1;
    if (ans)
      printf("YES\n");
    else
      printf("NO\n");
  }
  return 0;
}
