#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> graf;
vector<int> timein;
vector<int> timeout;
int timer = 0;
const int kolvo = 2e5;
int binup[kolvo][19];
int a, l;
int rast[kolvo];
void dfs(int v, int deep, int p = 0) {
  rast[v] = deep;
  timein[v] = timer++;
  binup[v][0] = p;
  for (int q = 1; q <= l; q++) {
    binup[v][q] = binup[binup[v][q - 1]][q - 1];
  }
  for (int q = 0; q < graf[v].size(); q++) {
    if (graf[v][q] != p) {
      dfs(graf[v][q], deep + 1, v);
    }
  }
  timeout[v] = timer++;
}
bool check(int v1, int v2) {
  return timein[v1] <= timein[v2] && timeout[v1] >= timeout[v2];
}
int lca(int v1, int v2) {
  if (check(v1, v2)) {
    return v1;
  }
  if (check(v2, v1)) {
    return v2;
  }
  for (int q = l; q >= 0; q--) {
    if (!check(binup[v1][q], v2)) {
      v1 = binup[v1][q];
    }
  }
  return binup[v1][0];
}
int rrast(int a, int b) { return rast[a] + rast[b] - 2 * rast[lca(a, b)]; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  rast[0] = 0;
  int b, c, t;
  cin >> a;
  graf.resize(a);
  for (int q = 1; q < a; q++) {
    cin >> b >> c;
    graf[c - 1].push_back(b - 1);
    graf[b - 1].push_back(c - 1);
  }
  timeout.resize(a);
  timein.resize(a);
  while ((1 << l) < a) {
    l++;
  }
  dfs(0, 0, 0);
  cin >> t;
  int d, e, f, g;
  while (t--) {
    cin >> c >> d >> e >> f >> g;
    if (rrast(e - 1, f - 1) % 2 == g % 2 && rrast(e - 1, f - 1) <= g) {
      cout << "YES" << endl;
    } else if ((rrast(e - 1, c - 1) + rrast(f - 1, d - 1) + 1) % 2 == g % 2 &&
               (rrast(e - 1, c - 1) + rrast(f - 1, d - 1) + 1) <= g) {
      cout << "YES" << endl;
    } else if ((rrast(f - 1, c - 1) + rrast(e - 1, d - 1) + 1) % 2 == g % 2 &&
               (rrast(f - 1, c - 1) + rrast(e - 1, d - 1) + 1) <= g) {
      cout << "YES" << endl;
    } else {
      cout << "NO" << endl;
    }
  }
}
