#include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> g[100009];
long long depth[100009];
long long dad[100009][30];
void dfs(long long v, long long prt) {
  dad[v][0] = prt;
  for (long long i = 1; i < 30; ++i) dad[v][i] = dad[dad[v][i - 1]][i - 1];
  for (auto u : g[v]) {
    if (u == prt) continue;
    depth[u] = depth[v] + 1;
    dfs(u, v);
  }
}
long long lca(long long x, long long y) {
  if (depth[y] > depth[x]) swap(x, y);
  for (long long i = 29; i >= 0; --i)
    if (depth[dad[x][i]] >= depth[y]) x = dad[x][i];
  if (x == y) return x;
  for (long long i = 29; i >= 0; --i)
    if (dad[x][i] != dad[y][i]) {
      x = dad[x][i];
      y = dad[y][i];
    }
  return dad[y][0];
}
long long dist(long long x, long long y) {
  long long lc = lca(x, y);
  return depth[x] - depth[lc] + depth[y] - depth[lc];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n;
  for (long long i = 0; i < n - 1; ++i) {
    long long x, y;
    cin >> x >> y;
    g[x].push_back(y);
    g[y].push_back(x);
  }
  dfs(1, 0);
  long long q;
  cin >> q;
  while (q--) {
    long long x, y, a, b, k;
    cin >> x >> y >> a >> b >> k;
    if (dist(a, b) <= k && (k - dist(a, b)) % 2 == 0)
      cout << "YES\n";
    else if (dist(a, x) + dist(b, y) + 1 <= k &&
             (k - (dist(a, x) + dist(b, y) + 1)) % 2 == 0)
      cout << "YES\n";
    else if (dist(a, y) + dist(b, x) + 1 <= k &&
             (k - (dist(a, y) + dist(b, x) + 1)) % 2 == 0)
      cout << "YES\n";
    else
      cout << "NO\n";
  }
}
