#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e18;
const double EPS = 1e-6;
const int MAX_N = 3e5 + 5;
const int MAX_LOG = 25;
int N;
vector<int> adjList[MAX_N];
int depth[MAX_N], parent[MAX_N][MAX_LOG];
void DFS(int u, int p, int d) {
  depth[u] = d;
  parent[u][0] = p;
  for (int v : adjList[u]) {
    if (v != p) DFS(v, u, d + 1);
  }
}
void LCA_precompute() {
  DFS(1, 0, 0);
  for (int k = 1; k < MAX_LOG; ++k) {
    for (int i = 1; i <= N; ++i) {
      parent[i][k] = parent[parent[i][k - 1]][k - 1];
    }
  }
}
int lift(int u, int h) {
  for (int i = 0; (1 << i) <= h; ++i) {
    if ((h & (1 << i)) != 0) {
      u = parent[u][i];
    }
  }
  return u;
}
int LCA(int a, int b) {
  if (depth[a] < depth[b]) {
    b = lift(b, depth[b] - depth[a]);
  } else if (depth[b] < depth[a]) {
    a = lift(a, depth[a] - depth[b]);
  }
  if (a == b) return a;
  for (int k = MAX_LOG - 1; k >= 0; --k) {
    if (parent[a][k] != parent[b][k]) {
      a = parent[a][k], b = parent[b][k];
    }
  }
  return parent[a][0];
}
int dist(int a, int b) {
  int lca = LCA(a, b);
  return depth[a] + depth[b] - 2 * depth[lca];
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> N;
  for (int i = 0; i < N - 1; ++i) {
    int u, v;
    cin >> u >> v;
    adjList[u].push_back(v);
    adjList[v].push_back(u);
  }
  LCA_precompute();
  int q;
  cin >> q;
  while (q-- > 0) {
    int x, y, a, b, k;
    cin >> x >> y >> a >> b >> k;
    bool ans = false;
    if (dist(a, b) <= k && (k - dist(a, b)) % 2 == 0) ans = true;
    int d = dist(a, x) + dist(b, y) + 1;
    if (d <= k && (k - d) % 2 == 0) ans = true;
    d = dist(b, x) + dist(a, y) + 1;
    if (d <= k && (k - d) % 2 == 0) ans = true;
    if (ans)
      cout << "YES\n";
    else
      cout << "NO\n";
  }
  return 0;
}
