#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> v;
int N;
int pa[100005][18];
int h[100006];
int chk[100006];
void dfs(int x) {
  chk[x] = 1;
  for (int y : v[x])
    if (!chk[y]) {
      pa[y][0] = x;
      h[y] = h[x] + 1;
      dfs(y);
    }
}
long long dis(int x, int y) {
  if (h[x] > h[y]) swap(x, y);
  int k = h[y] - h[x];
  long long res = k;
  for (int i = 0; i < 18; i++)
    if ((k >> i) & 1) y = pa[y][i];
  if (x == y) return res;
  for (int i = 17; i >= 0; i--)
    if (pa[x][i] != pa[y][i]) {
      x = pa[x][i];
      y = pa[y][i];
      res += 2 << i;
    }
  return res + 2;
}
int main() {
  scanf("%d", &N);
  v.resize(N + 1);
  for (int i = 1; i < N; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    v[x].push_back(y);
    v[y].push_back(x);
  }
  dfs(1);
  pa[1][0] = 1;
  for (int j = 1; j <= 17; j++)
    for (int i = 1; i <= N; i++) pa[i][j] = pa[pa[i][j - 1]][j - 1];
  int Q;
  scanf("%d", &Q);
  while (Q--) {
    int x, y, a, b, k;
    scanf("%d%d%d%d%d", &x, &y, &a, &b, &k);
    long long len;
    len = dis(a, b);
    if (k >= len && (k - len) % 2 == 0) {
      puts("YES");
      continue;
    }
    len = dis(a, x) + 1 + dis(y, b);
    if (k >= len && (k - len) % 2 == 0) {
      puts("YES");
      continue;
    }
    len = dis(a, y) + 1 + dis(x, b);
    if (k >= len && (k - len) % 2 == 0) {
      puts("YES");
      continue;
    }
    puts("NO");
  }
  return 0;
}
