#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e5 + 5, mod = 1e9 + 7, inf = 0x3f3f3f3f;
long long n, m, Q, K, T;
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;
}
long long e = 1, to[maxn << 1], hed[maxn], nxt[maxn << 1];
void add(long long x, long long y) {
  to[++e] = y;
  nxt[e] = hed[x];
  hed[x] = e;
  to[++e] = x;
  nxt[e] = hed[y];
  hed[y] = e;
}
long long fa[maxn], dep[maxn], siz[maxn], son[maxn], top[maxn];
void dfs1(long long x, long long fu, long long deep) {
  siz[x] = 1, fa[x] = fu;
  dep[x] = deep;
  for (long long i = hed[x]; i; i = nxt[i]) {
    if (to[i] == fu) continue;
    dfs1(to[i], x, deep + 1);
    siz[x] += siz[to[i]];
    if (siz[to[i]] > siz[son[x]]) son[x] = to[i];
  }
  return;
}
void dfs2(long long x, long long topx) {
  top[x] = topx;
  if (!son[x]) return;
  dfs2(son[x], topx);
  for (long long i = hed[x]; i; i = nxt[i]) {
    if (to[i] == fa[x] || to[i] == son[x]) continue;
    dfs2(to[i], to[i]);
  }
  return;
}
long long lca(long long x, long long y) {
  while (top[x] != top[y]) {
    if (dep[top[x]] < dep[top[y]]) swap(x, y);
    x = fa[top[x]];
  }
  if (dep[x] > dep[y]) swap(x, y);
  return x;
}
long long dis(long long x, long long y) {
  return dep[x] + dep[y] - dep[lca(x, y)] * 2;
}
bool check(long long x, long long y, long long a, long long b, long long k) {
  long long goal = (k & 1);
  long long k1 = ((dis(a, b))), k2 = ((dis(a, x) + dis(b, y) + 1));
  long long k3 = ((dis(a, y) + dis(b, x) + 1));
  if (k1 <= k && k1 % 2 == goal) return true;
  if (k2 <= k && k2 % 2 == goal) return true;
  if (k3 <= k && k3 % 2 == goal) return true;
  return false;
}
signed main() {
  n = read();
  for (long long i = (1); i <= (n - 1); ++i) add(read(), read());
  dfs1(1, 0, 1);
  dfs2(1, 1);
  Q = read();
  while (Q--) {
    long long x = read(), y = read(), a = read(), b = read(), k = read();
    puts((check(x, y, a, b, k)) ? "YES" : "NO");
  }
  return 0;
}
