#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int MAXN = 2e5 + 100;
const int INF = 0x3f3f3f3f;
inline long long fpow(long long a, long long b) {
  long long r = 1, t = a;
  while (b) {
    if (b & 1) r = (r * t) % MOD;
    b >>= 1;
    t = (t * t) % MOD;
  }
  return r;
}
vector<int> G[MAXN << 1];
int dep[MAXN], f[MAXN][30], n, q;
int dis[MAXN];
void dfs(int x, int fa) {
  dep[x] = dep[fa] + 1;
  f[x][0] = fa;
  for (int i = 1; (1 << i) <= dep[x]; i++) f[x][i] = f[f[x][i - 1]][i - 1];
  for (auto it : G[x]) {
    if (it != fa) dis[it] = dis[x] + 1, dfs(it, x);
  }
}
int LCA(int x, int y) {
  if (dep[x] < dep[y]) swap(x, y);
  for (int i = 21; i >= 0; i--) {
    if (dep[x] - (1 << i) >= dep[y]) x = f[x][i];
  }
  if (x == y) return x;
  for (int i = 21; i >= 0; i--) {
    if (f[x][i] == f[y][i]) continue;
    x = f[x][i], y = f[y][i];
  }
  return f[x][0];
}
int main() {
  cin >> n;
  for (int i = 1; i < n; i++) {
    int ui, vi;
    scanf("%d %d", &ui, &vi);
    G[ui].push_back(vi);
    G[vi].push_back(ui);
  }
  dfs(1, 0);
  cin >> q;
  while (q--) {
    int x, y, u, v, k;
    scanf("%d %d %d %d %d", &x, &y, &u, &v, &k);
    int num = dis[x] + dis[y] - 2 * dis[LCA(x, y)] + 1;
    int uv = dis[u] + dis[v] - 2 * dis[LCA(u, v)];
    int ux = dis[u] + dis[x] - 2 * dis[LCA(u, x)];
    int uy = dis[u] + dis[y] - 2 * dis[LCA(u, y)];
    int vx = dis[v] + dis[x] - 2 * dis[LCA(v, x)];
    int vy = dis[v] + dis[y] - 2 * dis[LCA(v, y)];
    if ((uv & 1) == (k & 1)) {
      if (uv <= k)
        printf("YES\n");
      else {
        if (!(num & 1) && (ux + 1 + vy <= k || (uy + 1 + vx <= k)))
          printf("YES\n");
        else
          printf("NO\n");
      }
    } else {
      if (!(num & 1))
        printf("NO\n");
      else {
        if (ux + 1 + vy <= k || uy + 1 + vx <= k)
          printf("YES\n");
        else
          printf("NO\n");
      }
    }
  }
  return 0;
}
