#include <bits/stdc++.h>
using namespace std;
int n, m;
int qur;
bool vis[200001];
int f[200001][21], deep[200001];
int first[200001], nex[200001], v[200001], num;
inline void add(int x, int y) {
  num++;
  v[num] = y;
  nex[num] = first[x];
  first[x] = num;
}
inline void pre(int u, int fa) {
  vis[u] = true;
  deep[u] = deep[fa] + 1;
  f[u][0] = fa;
  for (int i = 1; i <= 20; i++) {
    f[u][i] = f[f[u][i - 1]][i - 1];
  }
  for (int i = first[u]; i != -1; i = nex[i]) {
    int to = v[i];
    if (!vis[to]) pre(to, u);
  }
}
inline int lca(int x, int y) {
  if (deep[x] < deep[y]) swap(x, y);
  for (int i = 20; i >= 0; i--) {
    if (deep[f[x][i]] >= deep[y]) {
      x = f[x][i];
    }
  }
  if (x == y) return x;
  for (int i = 20; i >= 0; i--) {
    if (f[x][i] != f[y][i]) {
      x = f[x][i];
      y = f[y][i];
    }
  }
  return f[x][0];
}
int main() {
  memset(first, -1, sizeof first);
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    int x, y;
    scanf("%d %d", &x, &y);
    add(x, y);
    add(y, x);
  }
  pre(1, 0);
  scanf("%d", &m);
  for (int i = 1; i <= m; i++) {
    int x, y, a, b, k;
    bool flag = false;
    scanf("%d %d %d %d %d", &x, &y, &a, &b, &k);
    int len1 = deep[a] + deep[b] - 2 * deep[lca(a, b)];
    int len2 = deep[a] + deep[x] - 2 * deep[lca(a, x)] + deep[y] + deep[b] -
               2 * deep[lca(y, b)] + 1;
    int len3 = deep[a] + deep[y] - 2 * deep[lca(a, y)] + 1 + deep[x] + deep[b] -
               2 * deep[lca(x, b)];
    if (len1 <= k && (k - len1) % 2 == 0) {
      flag = true;
    }
    if (len2 <= k && (k - len2) % 2 == 0) {
      flag = true;
    }
    if (len3 <= k && (k - len3) % 2 == 0) {
      flag = true;
    }
    if (flag)
      puts("YES");
    else
      puts("NO");
  }
  return 0;
}
