#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 41;
const int mod = 1e9 + 7;
const int inf = 1e9 + 90;
const long long INF = 1e18;
vector<int> g[N];
int tin[N], tout[N], up[N][20], d[N], timer, a, b;
void dfs(int v = 1, int p = 1) {
  tin[v] = ++timer;
  up[v][0] = p;
  for (int i = 1; i <= 18; ++i) {
    up[v][i] = up[up[v][i - 1]][i - 1];
  }
  for (int to : g[v])
    if (to != p) {
      d[to] = d[v] + 1;
      dfs(to, v);
    }
  tout[v] = ++timer;
}
bool upper(int a, int b) { return tin[a] <= tin[b] && tout[a] >= tout[b]; }
int lca(int a, int b) {
  if (upper(a, b)) return a;
  if (upper(b, a)) return b;
  for (int i = 18; i >= 0; --i) {
    if (!upper(up[a][i], b)) {
      a = up[a][i];
    }
  }
  return up[a][0];
}
int dist(int a, int b) { return d[a] + d[b] - 2 * d[lca(a, b)]; }
bool ok(int dist1, int dist2) {
  return dist1 >= dist2 && ((dist1 & 1) == (dist2 & 1));
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  ;
  int n;
  cin >> n;
  for (int i = 1; i < n; ++i) {
    cin >> a >> b;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  dfs();
  int q;
  cin >> q;
  while (q--) {
    int x, y, a, b, k;
    cin >> x >> y >> a >> b >> k;
    bool res = 0;
    res |= ok(k, dist(a, b));
    res |= ok(k, dist(a, x) + 1 + dist(y, b));
    res |= ok(k, dist(a, y) + 1 + dist(x, b));
    res |= ok(k, dist(x, y) + 1 + dist(a, x) + dist(x, b));
    res |= ok(k, dist(x, y) + 1 + dist(a, y) + dist(y, b));
    cout << (res ? "YES\n" : "NO\n");
  }
}
