#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 1e5;
vector<int> v[N + 5];
int vis[N + 5];
int d[N + 5], f[N + 5][50];
int n;
int t;
queue<int> q;
void bfs() {
  q.push(1);
  d[1] = 1;
  while (q.size()) {
    int x = q.front();
    q.pop();
    for (auto y : v[x]) {
      if (d[y]) continue;
      d[y] = d[x] + 1;
      f[y][0] = x;
      for (int j = 1; j <= t; j++) f[y][j] = f[f[y][j - 1]][j - 1];
      q.push(y);
    }
  }
}
int lca(int x, int y) {
  if (d[x] > d[y]) swap(x, y);
  for (int i = t; i >= 0; i--)
    if (d[f[y][i]] >= d[x]) y = f[y][i];
  if (x == y) return x;
  for (int i = t; i >= 0; i--) {
    if (f[x][i] != f[y][i]) {
      x = f[x][i];
      y = f[y][i];
    }
  }
  return f[x][0];
}
int main() {
  scanf("%d", &n);
  t = (int)(log(n) / log(2.0)) + 1;
  for (int i = 1; i < n; i++) {
    int uu, vv;
    scanf("%d%d", &uu, &vv);
    v[uu].push_back(vv);
    v[vv].push_back(uu);
  }
  bfs();
  int q;
  scanf("%d", &q);
  while (q--) {
    int x, y, a, b, k;
    scanf("%d%d%d%d%d", &x, &y, &a, &b, &k);
    int dis1 = d[a] + d[b] - 2 * d[lca(a, b)];
    int dis2 =
        d[a] + d[x] - 2 * d[lca(x, a)] + d[b] + d[y] - 2 * d[lca(y, b)] + 1;
    int dis3 =
        d[a] + d[y] - 2 * d[lca(y, a)] + d[b] + d[x] - 2 * d[lca(x, b)] + 1;
    bool f = false;
    if (k >= dis1) {
      if ((k - dis1) % 2 == 0) f = true;
    }
    if (k >= dis2) {
      if ((k - dis2) % 2 == 0) f = true;
    }
    if (k >= dis3) {
      if ((k - dis3) % 2 == 0) f = true;
    }
    if (f)
      printf("YES\n");
    else
      printf("NO\n");
  }
  return 0;
}
