#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const int maxn = 100007;
struct node {
  int to, w;
  node(int a = 0, int b = 0) {
    to = a;
    w = b;
  }
};
vector<node> e[maxn];
int f[maxn], dis[maxn], deep[maxn], p[maxn][20], n;
void dfs(int u, int pre, int t) {
  int i, num;
  deep[u] = t;
  f[u] = pre;
  num = e[u].size();
  for (i = 0; i < num; i++) {
    int v = e[u][i].to;
    if (v != pre) {
      dis[v] = dis[u] + e[u][i].w;
      dfs(v, u, t + 1);
    }
  }
}
void init() {
  int i, j;
  for (j = 1; (1 << j) <= n; j++)
    for (i = 1; i <= n; i++) p[i][j] = -1;
  for (i = 1; i <= n; i++) p[i][0] = f[i];
  for (j = 1; (1 << j) <= n; j++) {
    for (i = 1; i <= n; i++) {
      if (p[i][j - 1] != -1) p[i][j] = p[p[i][j - 1]][j - 1];
    }
  }
}
int lca(int a, int b) {
  int i, j;
  if (deep[a] < deep[b]) swap(a, b);
  for (i = 0; (1 << i) <= deep[a]; i++)
    ;
  i--;
  for (j = i; j >= 0; j--) {
    if (deep[a] - (1 << j) >= deep[b]) {
      a = p[a][j];
    }
  }
  if (a == b) return a;
  for (j = i; j >= 0; j--) {
    if (p[a][j] != -1 && p[a][j] != p[b][j]) {
      a = p[a][j];
      b = p[b][j];
    }
  }
  return f[a];
}
int flca(int x, int y) {
  int l = lca(x, y);
  if (l == x) {
    return deep[y] - deep[l];
  } else if (l == y) {
    return deep[x] - deep[l];
  }
  return deep[x] + deep[y] - 2 * deep[l];
}
int main() {
  int m, i, a, b, c, ans;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) e[i].clear();
  for (i = 1; i < n; i++) {
    scanf("%d%d", &a, &b);
    e[a].push_back(node(b, 1));
    e[b].push_back(node(a, 1));
  }
  dis[1] = 0;
  dfs(1, -1, 0);
  init();
  scanf("%d", &m);
  for (i = 0; i < m; i++) {
    int x, y, k;
    scanf("%d %d %d %d %d", &x, &y, &a, &b, &k);
    int t1 = flca(a, b);
    int t2 = flca(x, a) + flca(y, b) + 1;
    int t3 = flca(x, b) + flca(y, a) + 1;
    if ((t1 % 2 == k % 2 && t1 <= k) || (t2 % 2 == k % 2 && t2 <= k) ||
        (t3 % 2 == k % 2 && t3 <= k)) {
      printf("YES\n");
    } else {
      printf("NO\n");
    }
  }
  return 0;
}
