#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const double EPS = 1e-9;
const long long MOD = 1e9 + 7;
const long long INF = 0x3f3f3f3f;
const long long MAXN = 1e5 + 7;
const long long LOG = 20;
int n, q, h[MAXN], f[MAXN][LOG];
vector<int> g[MAXN];
void dfs(int u, int fa, int height) {
  h[u] = height;
  f[u][0] = fa;
  for (int i = 1; i < LOG; ++i) f[u][i] = f[f[u][i - 1]][i - 1];
  for (auto v : g[u]) {
    if (v == fa) continue;
    dfs(v, u, height + 1);
  }
}
int proc(int a, int b) {
  int x = h[a], y = h[b];
  if (x < y) swap(a, b);
  for (int i = LOG - 1; i >= 0; --i) {
    if (h[f[a][i]] >= h[b]) a = f[a][i];
  }
  if (h[a] > h[b]) a = f[a][0];
  for (int i = LOG - 1; i >= 0; --i) {
    if (f[a][i] != f[b][i]) a = f[a][i], b = f[b][i];
  }
  if (a != b) a = f[a][0];
  int z = x - h[a] + y - h[a];
  return z;
}
void solve() {
  cin >> n;
  for (int u, v, i = 1; i < n; ++i) {
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  dfs(1, 0, 1);
  int x, y, a, b, k;
  cin >> q;
  while (q--) {
    cin >> x >> y >> a >> b >> k;
    vector<int> path;
    path.push_back(proc(a, b));
    path.push_back(proc(a, x) + 1 + proc(y, b));
    path.push_back(proc(a, y) + 1 + proc(x, b));
    int ans = 0;
    for (auto v : path) ans |= (v <= k && (v & 1) == (k & 1));
    cout << (ans ? "YES" : "NO") << endl;
  }
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int i, Case = 1;
  while (Case--) solve();
  return 0;
}
