#include <bits/stdc++.h>
using namespace std;
using namespace chrono;
int setBit(int n, int x) { return n | (1 << x); }
int clearBit(int n, int x) { return n & ~(1 << x); }
int toggleBit(int n, int x) { return n ^ (1 << x); }
bool checkBit(int n, int x) { return (bool)(n & (1 << x)); }
int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};
int dx4[] = {1, 0, -1, 0};
int dy4[] = {0, 1, 0, -1};
void yes() { cout << "YES" << endl; }
void no() { cout << "NO" << endl; }
template <typename T>
void amax(T& t1, T t2) {
  t1 = max(t1, t2);
}
template <typename T>
void amin(T& t1, T t2) {
  t1 = min(t1, t2);
}
void _print(long long t) { cerr << t; }
void _print(int t) { cerr << t; }
void _print(string t) { cerr << t; }
void _print(char t) { cerr << t; }
void _print(long double t) { cerr << t; }
void _print(double t) { cerr << t; }
void _print(unsigned long long t) { cerr << t; }
template <class T, class V>
void _print(pair<T, V> p);
template <class T>
void _print(vector<T> v);
template <class T>
void _print(set<T> v);
template <class T, class V>
void _print(map<T, V> v);
template <class T>
void _print(multiset<T> v);
template <class T, class V>
void _print(pair<T, V> p) {
  cerr << "{";
  _print(p.first);
  cerr << ",";
  _print(p.second);
  cerr << "}";
}
template <class T>
void _print(vector<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(set<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(multiset<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T, class V>
void _print(map<T, V> v) {
  cerr << "[ ";
  for (auto i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
long long binpow(long long a, long long b, long long m) {
  long long ans = 1;
  a %= m;
  while (b) {
    if (b & 1) ans = (ans * a);
    b /= 2;
    a = (a * a);
    ans %= m;
    a %= m;
  }
  return ans;
}
struct cmp {
  bool operator()(pair<long long, long long> a, pair<long long, long long> b) {
    return ((a.first - a.first / 2) * a.second) >
           ((b.first - b.first / 2) * b.second);
  }
};
const int N = 1e5 + 5;
vector<int> g[N];
int up[N][24];
int lvl[N];
int n, q;
int T;
void fill_lvl(int src, int p) {
  if (src != p) lvl[src] = lvl[p] + 1;
  for (auto e : g[src]) {
    if (e == p) continue;
    fill_lvl(e, src);
  }
  return;
}
void binary_lifting(int src, int p) {
  up[src][0] = p;
  for (int i = 1; i < 20; i++) {
    up[src][i] = -1;
    if (up[src][i - 1] != -1) {
      up[src][i] = up[up[src][i - 1]][i - 1];
    }
  }
  for (auto e : g[src]) {
    if (e == p) continue;
    binary_lifting(e, src);
  }
  return;
}
int lift_node(int src, int jump) {
  int node = src;
  for (int i = 19; i >= 0; i--) {
    int mask = (1 << i);
    if (mask & jump) {
      node = up[node][i];
    }
    if (node == -1) break;
  }
  return node;
}
int LCA(int u, int v) {
  if (lvl[u] < lvl[v]) swap(u, v);
  u = lift_node(u, lvl[u] - lvl[v]);
  if (u == v) return u;
  for (int i = 19; i >= 0; i--) {
    if (up[u][i] != up[v][i]) {
      u = up[u][i];
      v = up[v][i];
    }
  }
  return lift_node(u, 1);
}
int dist(int a, int b) {
  int lca = LCA(a, b);
  return lvl[a] + lvl[b] - 2 * lvl[lca];
}
void JAI_MAHAKAL() {
  cin >> n;
  int x, y, a, b, k;
  for (int i = 1; i < n; i++) {
    cin >> x >> y;
    g[x].push_back(y);
    g[y].push_back(x);
  }
  cin >> q;
  fill_lvl(1, 1);
  binary_lifting(1, -1);
  while (q--) {
    cin >> x >> y >> a >> b >> k;
    int op1 = dist(a, b);
    int op2 = dist(a, x) + dist(y, b) + 1;
    int op3 = dist(a, y) + dist(x, b) + 1;
    int ok = 0;
    if (op1 % 2 == k % 2 and op1 <= k) ok = 1;
    if (op2 % 2 == k % 2 and op2 <= k) ok = 1;
    if (op3 % 2 == k % 2 and op3 <= k) ok = 1;
    if (ok)
      yes();
    else
      no();
  }
  return;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  while (t--) JAI_MAHAKAL();
  cerr << "Time elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
