#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7, INF = 0x3f3f3f3f;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qpow(long long a, long long n) {
  long long r = 1 % P;
  for (a %= P; n; a = a * a % P, n >>= 1)
    if (n & 1) r = r * a % P;
  return r;
}
long long inv(long long first) {
  return first <= 1 ? 1 : inv(P % first) * (P - P / first) % P;
}
inline int rd() {
  int first = 0;
  char p = getchar();
  while (p < '0' || p > '9') p = getchar();
  while (p >= '0' && p <= '9') first = first * 10 + p - '0', p = getchar();
  return first;
}
const int N = 1e6 + 50;
int n, m, s, sz[N], dep[N];
int L[N], R[N], fa[N], son[N], top[N];
vector<int> g[N];
void dfs(int first, int d, int f) {
  sz[first] = 1, fa[first] = f, dep[first] = d;
  for (int second : g[first])
    if (second != f) {
      dfs(second, d + 1, first), sz[first] += sz[second];
      if (sz[second] > sz[son[first]]) son[first] = second;
    }
}
void dfs(int first, int tf) {
  top[first] = tf;
  if (son[first]) dfs(son[first], tf);
  for (int second : g[first])
    if (!top[second]) dfs(second, second);
}
int lca(int first, int second) {
  while (top[first] != top[second]) {
    if (dep[top[first]] < dep[top[second]]) swap(first, second);
    first = fa[top[first]];
  }
  return dep[first] < dep[second] ? first : second;
}
int dis(int first, int second) {
  return dep[first] + dep[second] - 2 * dep[lca(first, second)];
}
int main() {
  scanf("%d", &n);
  for (int i = 2; i <= n; ++i) {
    int u, v;
    scanf("%d%d", &u, &v);
    g[u].push_back(v);
    g[v].push_back(u);
  }
  dfs(1, 0, 0), dfs(1, 1);
  int q;
  scanf("%d", &q);
  while (q--) {
    int first, second, a, b, k;
    scanf("%d%d%d%d%d", &first, &second, &a, &b, &k);
    int d1 = dis(a, b);
    if (d1 <= k && d1 % 2 == k % 2) {
      puts("YES");
      continue;
    }
    int d2 = dis(a, first) + 1 + dis(second, b);
    if (d2 <= k && d2 % 2 == k % 2) {
      puts("YES");
      continue;
    }
    int d3 = dis(a, second) + 1 + dis(first, b);
    if (d3 <= k && d3 % 2 == k % 2) {
      puts("YES");
      continue;
    }
    if (d2 > d3) swap(d2, d3);
    int c = d3 - d1;
    if (c % 2 == 1) {
      puts("NO");
      continue;
    }
    if (k - d1 >= c && (k - d1 - c) % 2 == 0 ||
        k - d2 >= c && (k - d2 - c) % 2 == 0)
      puts("YES");
    else
      puts("NO");
  }
}
