#include <bits/stdc++.h>
using namespace std;
const int inf = 1 << 30;
const long long INF = 1ll << 60;
const double Inf = 1e20;
const double eps = 1e-9;
void gmax(int &a, int b) { a = (a > b ? a : b); }
void gmin(int &a, int b) { a = (a < b ? a : b); }
const int maxn = 100050;
int n, dep[maxn], fa[maxn][20];
vector<int> adj[maxn];
void dfs(int u) {
  for (auto p : adj[u])
    if (!dep[p]) {
      dep[p] = dep[u] + 1;
      fa[p][0] = u;
      dfs(p);
    }
}
int get_lca(int u, int v) {
  if (dep[u] < dep[v]) swap(u, v);
  int c = (dep[u] - dep[v]);
  for (int j = 19; j >= 0; --j)
    if (c & (1 << j)) u = fa[u][j];
  for (int j = 19; j >= 0; --j)
    if (fa[u][j] != fa[v][j]) u = fa[u][j], v = fa[v][j];
  if (u != v)
    return fa[u][0];
  else
    return u;
}
int calc(int x, int y) { return dep[x] + dep[y] - 2 * dep[get_lca(x, y)]; }
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n - 1; ++i) {
    int u, v;
    scanf("%d%d", &u, &v);
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  dep[1] = 1;
  dfs(1);
  for (int j = 1; j <= 19; ++j)
    for (int i = 1; i <= n; ++i) fa[i][j] = fa[fa[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);
    if (calc(a, b) <= k && (calc(a, b) % 2) == (k % 2))
      printf("YES\n");
    else if ((calc(a, x) + 1 + calc(y, b)) <= k &&
             (calc(a, x) + 1 + calc(y, b)) % 2 == (k % 2))
      printf("YES\n");
    else if ((calc(a, y) + 1 + calc(x, b)) <= k &&
             (calc(a, y) + 1 + calc(x, b)) % 2 == (k % 2))
      printf("YES\n");
    else if ((calc(a, x) + calc(x, y) + 1 + calc(x, b)) <= k &&
             (calc(a, x) + calc(x, y) + 1 + calc(x, b)) % 2 == (k % 2))
      printf("YES\n");
    else if ((calc(a, y) + calc(y, x) + 1 + calc(y, b)) <= k &&
             (calc(a, y) + calc(y, x) + 1 + calc(y, b)) % 2 == (k % 2))
      printf("YES\n");
    else
      printf("NO\n");
  }
  return 0;
}
