#include <bits/stdc++.h>
using namespace std;
const int mod1 = 998244353, mod = 1e9 + 7;
const int MAXN = 1e6 + 6, MAXM = 2e5 + 5;
const int inf = 2e9;
const long long linf = 1e18;
template <class T>
struct RMQ {
  vector<vector<T>> spt;
  vector<int> lg;
  void init(const vector<T> &arr) {
    int N = arr.size(), tmp = 1, K = 1;
    while (tmp < N) tmp *= 2, ++K;
    lg.assign(N, 0);
    spt.assign(K, arr);
    for (int i = 2; i < N; i++) lg[i] = lg[i / 2] + 1;
    for (int i = 1; i < K; i++) {
      for (int j = 0; j < N; j++) {
        spt[i][j] =
            min(spt[i - 1][j], spt[i - 1][min(N - 1, j + (1 << (i - 1)))]);
      }
    }
  }
  T query(int l, int r) {
    int d = lg[r - l];
    return min(spt[d][l], spt[d][r - (1 << d)]);
  }
};
struct LCA {
  vector<int> st;
  vector<int> dep;
  vector<pair<int, int>> arr;
  int N;
  RMQ<pair<int, int>> rmq;
  LCA(vector<vector<int>> &adj, int r = 0) {
    N = adj.size();
    st.resize(N);
    dep.resize(N);
    arr.reserve(N * 2);
    dfs(adj, r, 0);
    rmq.init(arr);
  }
  void dfs(vector<vector<int>> &adj, int u, int p, int h = 0) {
    st[u] = arr.size();
    dep[u] = h;
    arr.emplace_back(h, u);
    for (auto v : adj[u])
      if (v != p) {
        dfs(adj, v, u, h + 1);
        arr.emplace_back(h, u);
      }
  }
  int query(int a, int b) {
    if (a == b) return a;
    a = st[a], b = st[b];
    return rmq.query(min(a, b), max(a, b)).second;
  }
  int dist(int a, int b) {
    int lca = query(a, b);
    return dep[a] + dep[b] - 2 * dep[lca];
  }
};
void Solve() {
  int n;
  cin >> n;
  vector<vector<int>> adj(n, vector<int>());
  for (int i = 1, u, v; i < n; i++) {
    cin >> u >> v;
    u--;
    v--;
    adj[u].emplace_back(v);
    adj[v].emplace_back(u);
  }
  LCA lca(adj);
  int q, x, y, a, b, k;
  cin >> q;
  while (q--) {
    cin >> x >> y >> a >> b >> k;
    x--;
    y--;
    a--;
    b--;
    int d1 = lca.dist(a, b);
    int d2 = lca.dist(a, x) + lca.dist(b, y) + 1;
    int d3 = lca.dist(a, y) + lca.dist(b, x) + 1;
    if ((d1 <= k && (k - d1) % 2 == 0) || (d2 <= k && (k - d2) % 2 == 0) ||
        (d3 <= k && (k - d3) % 2 == 0)) {
      cout << "YES\n";
    } else {
      cout << "NO\n";
    }
  }
}
signed main() {
  if (fopen(""
            ".inp",
            "r")) {
    freopen(
        ""
        ".inp",
        "r", stdin);
    freopen(
        ""
        ".out",
        "w", stdout);
  };
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int TC = 1;
  while (TC--) Solve();
  return 0;
}
