#include <bits/stdc++.h>
int dr[] = {2, 2, -2, -2, 1, -1, 1, -1};
int dc[] = {1, -1, 1, -1, 2, 2, -2, -2};
int dr1[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dc1[] = {1, -1, 1, 0, -1, 0, 1, -1};
int dr2[] = {0, 0, 1, -1};
int dc2[] = {1, -1, 0, 0};
using namespace std;
vector<long long> adj[500005];
long long lev[500005], tr[500005][20];
void dfs(long long u, long long par) {
  long long i, j;
  for (i = 0; i < adj[u].size(); i++) {
    long long p = adj[u][i];
    if (p == par) continue;
    lev[p] = lev[u] + 1;
    tr[p][0] = u;
    dfs(p, u);
  }
}
void build(long long n) {
  memset(tr, -1, sizeof(tr));
  dfs(1, -1);
  long long i, j;
  for (j = 1; (1 << j) <= n; j++) {
    for (i = 1; i <= n; i++) {
      if (tr[i][j - 1] != -1) tr[i][j] = tr[tr[i][j - 1]][j - 1];
    }
  }
}
long long query(long long p, long long q) {
  if (lev[q] > lev[p]) swap(p, q);
  long long i, j;
  for (i = 16; i >= 0; i--) {
    if (lev[p] - (1 << i) >= lev[q]) {
      p = tr[p][i];
    }
  }
  if (p == q) return p;
  for (i = 16; i >= 0; i--) {
    if (tr[p][i] != tr[q][i] && tr[p][i] != -1 && tr[q][i] != -1) {
      p = tr[p][i];
      q = tr[q][i];
    }
  }
  return tr[p][0];
}
long long dis(long long x, long long y) {
  long long p = query(x, y);
  return lev[x] + lev[y] - 2 * lev[p];
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long tc, n, i, j, m, q;
  while (cin >> n) {
    for (i = 1; i < n; i++) {
      long long u, v;
      cin >> u >> v;
      adj[u].push_back(v);
      adj[v].push_back(u);
    }
    build(n);
    cin >> q;
    while (q--) {
      long long x, y, a, b, k;
      cin >> x >> y >> a >> b >> k;
      long long d = dis(a, b);
      if (d <= k && d % 2 == k % 2) {
        cout << "YES" << endl;
        continue;
      }
      long long p1 = dis(x, a) + dis(y, b) + 1;
      long long p2 = dis(x, b) + dis(y, a) + 1;
      if (p1 <= k && p1 % 2 == k % 2) {
        cout << "YES" << endl;
        continue;
      }
      if (p2 <= k && p2 % 2 == k % 2) {
        cout << "YES" << endl;
        continue;
      }
      cout << "NO" << endl;
    }
  }
  return 0;
}
