#include <bits/stdc++.h>
using namespace std;
const int N = 200010, logN = 20;
long long read() {
  long long x = 0, f = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = x * 10 + c - '0';
    c = getchar();
  }
  return x * f;
}
struct node {
  int v, nxt;
} e[N];
int lca[N][logN + 1];
int head[N], ejs;
void add(int u, int v) {
  e[++ejs].v = v;
  e[ejs].nxt = head[u];
  head[u] = ejs;
}
int dis[N];
void dfs(int u, int fa) {
  for (int i = 1; i <= logN; ++i) lca[u][i] = lca[lca[u][i - 1]][i - 1];
  for (int i = head[u]; i; i = e[i].nxt) {
    int v = e[i].v;
    if (v == fa) continue;
    lca[v][0] = u;
    dis[v] = dis[u] + 1;
    dfs(v, u);
  }
}
int LCA(int x, int y) {
  if (dis[x] < dis[y]) swap(x, y);
  for (int i = logN; i >= 0; --i)
    if (dis[lca[x][i]] >= dis[y]) x = lca[x][i];
  for (int i = logN; i >= 0; --i)
    if (lca[x][i] != lca[y][i]) x = lca[x][i], y = lca[y][i];
  if (x != y) x = lca[x][0];
  return x;
}
int dist(int x, int y) { return dis[x] + dis[y] - 2 * dis[LCA(x, y)]; }
int main() {
  int n = read();
  for (int i = 1; i < n; ++i) {
    int u = read(), v = read();
    add(u, v);
    add(v, u);
  }
  dfs(1, 0);
  int Q = read();
  while (Q--) {
    int x = read(), y = read(), a = read(), b = read(), k = read();
    int t = dist(a, b);
    if (t <= k && (t & 1) == (k & 1)) {
      puts("YES");
      continue;
    }
    int t1 = dist(x, a), t2 = dist(y, b);
    t = t1 + t2 + 1;
    if (t <= k && (t & 1) == (k & 1)) {
      puts("YES");
      continue;
    }
    t1 = dist(x, b);
    t2 = dist(y, a);
    t = t1 + t2 + 1;
    if (t <= k && (t & 1) == (k & 1)) {
      puts("YES");
      continue;
    }
    puts("NO");
  }
  return 0;
}
