#include <bits/stdc++.h>
using namespace std;
int lca[100005][20], depth[100005], in[100005], out[100005], indx;
vector<int> son[100005];
void dfs(int now, int fat) {
  in[now] = ++indx;
  lca[now][0] = fat;
  int i;
  depth[now] = depth[fat] + 1;
  for (i = 1; i < 20; ++i) lca[now][i] = lca[lca[now][i - 1]][i - 1];
  for (i = 0; i < son[now].size(); ++i) {
    if (son[now][i] == fat) continue;
    dfs(son[now][i], now);
  }
  out[now] = indx;
}
inline int zz(int x, int y) { return (in[y] >= in[x]) && (out[x] >= out[y]); }
inline int lc(int x, int y) {
  int i;
  if (depth[x] < depth[y]) swap(x, y);
  for (i = 19; ~i; --i) {
    if (depth[x] - (1 << i) >= depth[y]) x = lca[x][i];
  }
  if (x == y) return x;
  for (i = 19; ~i; --i) {
    if (lca[x][i] != lca[y][i]) {
      x = lca[x][i];
      y = lca[y][i];
    }
  }
  return lca[x][0];
}
int n, i, q, dis1, dis2, dis3, rr, d, cir, f1, f2, f3, f4, p1, p2, x, y, a, b,
    k;
int main() {
  scanf("%d", &n);
  for (i = 1; i < n; ++i) {
    scanf("%d%d", &x, &y);
    son[x].push_back(y);
    son[y].push_back(x);
  }
  dfs(1, 0);
  scanf("%d", &q);
  while (q--) {
    cin >> x >> y >> a >> b >> k;
    dis1 = depth[a] + depth[b] - depth[lc(a, b)] * 2;
    dis2 = 1 + depth[a] + depth[x] - 2 * (depth[lc(a, x)]) + depth[b] +
           depth[y] - 2 * (depth[lc(b, y)]);
    dis3 = 1 + depth[a] + depth[x] - 2 * (depth[lc(a, y)]) + depth[b] +
           depth[y] - 2 * (depth[lc(b, x)]);
    if (dis1 <= k && (k - dis1) % 2 == 0)
      cout << "YES";
    else if (dis2 <= k && (k - dis2) % 2 == 0)
      cout << "YES";
    else if (dis3 <= k && (k - dis2) % 2 == 0)
      cout << "YES";
    else
      cout << "NO";
    cout << "\n";
  }
}
