#include <bits/stdc++.h>
using namespace std;
struct node {
  int begin, end, next;
} edge[100010 * 2 + 10];
int cnt, Head[100010], P[100010][19], deep[100010], n;
void addedge(int bb, int ee) {
  edge[++cnt].begin = bb;
  edge[cnt].end = ee;
  edge[cnt].next = Head[bb];
  Head[bb] = cnt;
}
void addedge1(int bb, int ee) {
  addedge(bb, ee);
  addedge(ee, bb);
}
void dfs(int u, int fa) {
  int i, v;
  for (i = Head[u]; i != -1; i = edge[i].next) {
    v = edge[i].end;
    if (v == fa) continue;
    P[v][0] = u;
    deep[v] = deep[u] + 1;
    dfs(v, u);
  }
}
void Ycl() {
  int i, j;
  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 x, int y) {
  int i, j;
  if (deep[x] < deep[y]) swap(x, y);
  for (i = 0; (1 << i) <= deep[x]; i++)
    ;
  i--;
  for (j = i; j >= 0; j--)
    if (deep[x] - (1 << j) >= deep[y]) x = P[x][j];
  if (x == y) return x;
  for (j = i; j >= 0; j--) {
    if (P[x][j] != -1 && P[x][j] != P[y][j]) {
      x = P[x][j];
      y = P[y][j];
    }
  }
  return P[x][0];
}
int DIS(int x, int y) {
  int z = LCA(x, y);
  return deep[x] + deep[y] - 2 * deep[z];
}
int main() {
  int i, u, v, TT, x, y, a, b, k, jl;
  scanf("%d", &n);
  memset(Head, -1, sizeof(Head));
  cnt = 1;
  for (i = 1; i < n; i++) {
    scanf("%d %d", &u, &v);
    addedge1(u, v);
  }
  memset(P, -1, sizeof(P));
  memset(deep, 0, sizeof(deep));
  dfs(1, 0);
  Ycl();
  scanf("%d", &TT);
  while (TT--) {
    scanf("%d %d %d %d %d", &x, &y, &a, &b, &k);
    jl = DIS(a, b);
    if (k >= jl && (k - jl) % 2 == 0) {
      printf("YES\n");
      continue;
    }
    jl = DIS(a, x) + 1 + DIS(y, b);
    if (k >= jl && (k - jl) % 2 == 0) {
      printf("YES\n");
      continue;
    }
    jl = DIS(a, y) + 1 + DIS(x, b);
    if (k >= jl && (k - jl) % 2 == 0) {
      printf("YES\n");
      continue;
    }
    printf("NO\n");
  }
  return 0;
}
