#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <typename T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <typename T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <typename T>
inline void println(T first) {
  print(first), putchar('\n');
}
template <typename T>
inline void printsp(T first) {
  print(first), putchar(' ');
}
template <class T, class T1>
inline void print(T first, T1 second) {
  printsp(first), println(second);
}
template <class T, class T1, class T2>
inline void print(T first, T1 second, T2 z) {
  printsp(first), printsp(second), println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
int E, head[100100], to[100100], nxt[100100], tp[100100];
void init(int n) {
  E = 0;
  for (int i = 1; i <= n; i++) head[i] = -1;
}
void add_edge(int u, int v, int t) {
  nxt[E] = head[u];
  to[E] = v;
  tp[E] = t;
  head[u] = E++;
}
int p[100100][20], deep[100100], len[100100], fa[100100];
void dfs(int u, int fa = 0) {
  p[u][0] = fa;
  deep[u] = deep[fa] + 1;
  for (int i = 1; i < 18; i++) p[u][i] = p[p[u][i - 1]][i - 1];
  for (int e = head[u]; e != -1; e = nxt[e]) {
    int v = to[e];
    if (v == fa) continue;
    len[v] = len[u] + (tp[e] == 0);
    dfs(v, u);
  }
}
int k_th(int u, int k) {
  for (int i = 0; i < 18; i++) {
    if (k & (1 << i)) u = p[u][i];
  }
  return u;
}
int lca(int a, int b) {
  if (deep[a] > deep[b]) swap(a, b);
  b = k_th(b, deep[b] - deep[a]);
  if (a == b) return a;
  for (int i = 18; i >= 0; i--) {
    if (p[a][0] == p[b][0]) break;
    if (p[a][i] != p[b][i]) a = p[a][i], b = p[b][i];
  }
  return p[a][0];
}
int main() {
  int n;
  gn(n);
  init(n);
  for (int i = 1, t; i <= n; i++) {
    gn(fa[i], t);
    if (fa[i] != -1) add_edge(fa[i], i, t);
  }
  for (int i = 1; i <= n; i++)
    if (fa[i] == -1) dfs(i);
  int m;
  int t, u, v, w;
  for (gn(m); m--;) {
    gn(t, v, u);
    if (u == v) {
      puts("NO");
      continue;
    }
    w = lca(u, v);
    if (w == 0) {
      puts("NO");
      continue;
    }
    if (t == 1) {
      if (w == v && len[u] - len[v] == deep[u] - deep[v])
        puts("YES");
      else
        puts("NO");
    } else {
      if (len[v] - len[w] == deep[v] - deep[w] && len[u] - len[w] == 0 &&
          deep[u] - deep[w])
        puts("YES");
      else
        puts("NO");
    }
  }
  return 0;
}
