#include <bits/stdc++.h>
using namespace std;
struct edge {
  int t, next;
} e[100010 * 2];
int fa[100010][30], head[100010], p, n, m, s = 1, depth[100010];
void add_edge(int s, int t) {
  p++;
  e[p].t = t;
  e[p].next = head[s];
  head[s] = p;
}
void dfs(int p, int fr) {
  depth[p] = depth[fr] + 1;
  fa[p][0] = fr;
  for (int i = 1; (1 << i) <= depth[p]; i++) {
    fa[p][i] = fa[fa[p][i - 1]][i - 1];
  }
  for (int i = head[p]; i; i = e[i].next) {
    if (!depth[e[i].t]) {
      dfs(e[i].t, p);
    }
  }
}
int LCA(int x, int y) {
  if (depth[x] > depth[y]) swap(x, y);
  for (int i = 20; i >= 0; i--) {
    if (depth[x] <= depth[y] - (1 << i)) {
      y = fa[y][i];
    }
  }
  if (x == y) return x;
  for (int i = 20; i >= 0; i--) {
    if (fa[x][i] == fa[y][i]) continue;
    x = fa[x][i];
    y = fa[y][i];
  }
  return fa[x][0];
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    add_edge(x, y);
    add_edge(y, x);
  }
  dfs(s, 0);
  scanf("%d", &m);
  while (m--) {
    int x, y, a, b, k;
    scanf("%d%d%d%d%d", &x, &y, &a, &b, &k);
    int lca_ab = LCA(a, b);
    int lca_ax = LCA(a, x);
    int lca_ay = LCA(a, y);
    int lca_bx = LCA(b, x);
    int lca_by = LCA(b, y);
    int lca_xy = LCA(x, y);
    int dis1 = depth[a] + depth[b] - 2 * depth[lca_ab];
    int dis2 = (depth[a] + depth[x] - 2 * depth[lca_ax]) + 1 +
               (depth[y] + depth[b] - 2 * depth[lca_by]);
    int dis3 = (depth[a] + depth[y] - 2 * depth[lca_ay]) + 1 +
               (depth[x] + depth[b] - 2 * depth[lca_bx]);
    int od = 0x7fffffff, ev = 0x7ffffffe;
    if (dis1 & 1)
      od = min(od, dis1);
    else
      ev = min(ev, dis1);
    if (dis2 & 1)
      od = min(od, dis2);
    else
      ev = min(ev, dis2);
    if (dis3 & 1)
      od = min(od, dis3);
    else
      ev = min(ev, dis3);
    if (k & 1) {
      if (k < od) {
        puts("NO");
      } else {
        puts("YES");
      }
    } else {
      if (k < ev) {
        puts("NO");
      } else {
        puts("YES");
      }
    }
  }
  return 0;
}
