#include <bits/stdc++.h>
using namespace std;
vector<int> aray[100001];
vector<int> euler;
int dist[100001];
void dfs(int root, int count) {
  dist[root] = count;
  euler.push_back(root);
  for (int i = 0; i < aray[root].size(); i++) {
    int val = aray[root][i];
    if (dist[val] == -1) {
      dfs(val, count + 1);
      euler.push_back(root);
    }
  }
  return;
}
bool valid(int a, int b) {
  if (a > b) return false;
  if (((a - b) % 2) == 0) return true;
  return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  int t = n - 1, x, y;
  while (t--) {
    cin >> x >> y;
    aray[x].push_back(y);
    aray[y].push_back(x);
  }
  for (int i = 1; i <= n; i++) dist[i] = -1;
  dfs(1, 0);
  int first[n + 1];
  for (int i = euler.size() - 1; i >= 0; i--) first[euler[i]] = i;
  int m = euler.size();
  int s = sqrt(m);
  int box = ceil((double)m / s);
  int num[box];
  for (int i = 0; i < box; i++) {
    num[i] = 1000000000;
    for (int j = i * s; j < min(m, (i + 1) * s); j++)
      num[i] = min(num[i], dist[euler[j]]);
  }
  int q;
  cin >> q;
  while (q--) {
    int arr[4], k;
    for (int i = 0; i < 4; i++) cin >> arr[i];
    cin >> k;
    int count = 0;
    bool ans = false;
    vector<int> dia;
    for (int i = 0; i < 2; i++) {
      for (int j = 2; j < 4; j++) {
        int fir = first[arr[i]], sec = first[arr[j]];
        int temp = min(fir, sec), tmep = max(fir, sec);
        fir = temp;
        sec = tmep;
        int bfir = fir / s, bsec = sec / s;
        int val = 100000000;
        if (bfir == bsec) {
          for (int i = fir; i <= sec; i++) val = min(val, dist[euler[i]]);
        } else {
          for (int i = bfir + 1; i < bsec; i++) val = min(val, num[i]);
          for (int i = fir; i < bfir * s + s; i++)
            val = min(val, dist[euler[i]]);
          for (int i = s * bsec; i <= sec; i++) val = min(val, dist[euler[i]]);
        }
        int distance = dist[arr[i]] + dist[arr[j]] - 2 * val;
        dia.push_back(distance);
      }
    }
    if (valid(dia[0] + dia[3] + 1, k)) ans = true;
    if (valid(dia[1] + dia[2] + 1, k)) ans = true;
    int fir = first[arr[2]], sec = first[arr[3]];
    int temp = min(fir, sec), tmep = max(fir, sec);
    fir = temp;
    sec = tmep;
    int bfir = fir / s, bsec = sec / s;
    int val = 10000000;
    if (bfir == bsec) {
      for (int i = fir; i <= sec; i++) val = min(val, dist[euler[i]]);
    } else {
      for (int i = bfir + 1; i < bsec; i++) val = min(val, num[i]);
      for (int i = fir; i < bfir * s + s; i++) val = min(val, dist[euler[i]]);
      for (int i = s * bsec; i <= sec; i++) val = min(val, dist[euler[i]]);
    }
    int distance = dist[arr[2]] + dist[arr[3]] - 2 * val;
    if (valid(distance, k)) ans = true;
    if ((distance <= k) && ((distance - k) % 2) == 0) ans = true;
    if (ans)
      cout << "YES\n";
    else
      cout << "NO\n";
  }
  return 0;
}
