#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 5e5;
const int INF = 987654321;
int N, QQ;
int C[MAXN+10];
vector<int> A[MAXN+10];
int L[MAXN+10], R[MAXN+10];
int P[MAXN+10], Q[MAXN+10];
struct SEG1
{
int tree[MAXN*4+10];
void update(int node, int tl, int tr, int p, int v)
{
if(tl==tr)
{
tree[node]=v;
return;
}
int mid=tl+tr>>1;
if(p<=mid) update(node*2, tl, mid, p, v);
else update(node*2+1, mid+1, tr, p, v);
tree[node]=max(tree[node*2], tree[node*2+1]);
}
int query1(int node, int tl, int tr, int l, int r)
{
int mid=tl+tr>>1;
if(l<=tl && tr<=r) return tree[node];
if(r<tl || tr<l) return -INF;
return max(query1(node*2, tl, mid, l, r), query1(node*2+1, mid+1, tr, l, r));
}
int query2(int node, int tl, int tr, int l, int r, int p)
{
if(r<tl || tr<l) return -1;
if(tree[node]<=p) return -1;
if(tl==tr) return tl;
int mid=tl+tr>>1;
int t=query2(node*2, tl, mid, l, r, p);
if(t!=-1) return t;
t=query2(node*2+1, mid+1, tr, l, r, p);
if(t!=-1) return t;
return -1;
}
}seg1, seg4;
struct SEG2
{
int tree[MAXN*4+10];
void update(int node, int tl, int tr, int p, int v)
{
if(tl==tr)
{
tree[node]=v;
return;
}
int mid=tl+tr>>1;
if(p<=mid) update(node*2, tl, mid, p, v);
else update(node*2+1, mid+1, tr, p, v);
tree[node]=min(tree[node*2], tree[node*2+1]);
}
int query1(int node, int tl, int tr, int l, int r)
{
int mid=tl+tr>>1;
if(l<=tl && tr<=r) return tree[node];
if(r<tl || tr<l) return INF;
return min(query1(node*2, tl, mid, l, r), query1(node*2+1, mid+1, tr, l, r));
}
int query2(int node, int tl, int tr, int l, int r, int p)
{
if(r<tl || tr<l) return -1;
if(tree[node]>=p) return -1;
if(tl==tr) return tl;
int mid=tl+tr>>1;
int t=query2(node*2+1, mid+1, tr, l, r, p);
if(t!=-1) return t;
t=query2(node*2, tl, mid, l, r, p);
if(t!=-1) return t;
return -1;
}
}seg2, seg3;
int main()
{
scanf("%d", &N);
for(int i=1; i<N; i++) scanf("%d", &C[i]);
for(int i=1; i<=N; i++) A[i].push_back(0);
for(int i=1; i<=N; i++)
{
int t;
scanf("%d", &t);
while(t--)
{
int p;
scanf("%d", &p);
A[p].push_back(i);
}
}
for(int i=1; i<=N; i++) A[i].push_back(N+1);
for(int i=1; i<N; i++)
{
int col=C[i];
L[i]=*(--upper_bound(A[col].begin(), A[col].end(), i));
R[i]=*lower_bound(A[col].begin(), A[col].end(), i+1);
}
L[0]=0; R[0]=N+1;
L[N]=0; R[N]=N+1;
for(int i=1; i<=N; i++) seg1.update(1, 1, N, i, R[i-1]);
for(int i=1; i<N; i++)
{
if(seg1.query1(1, 1, N, L[i]+1, i)<=i) P[i]=N+1;
else P[i]=seg1.query2(1, 1, N, L[i]+1, i, i);
seg3.update(1, 1, N, i, P[i]);
}
for(int i=1; i<N; i++) seg2.update(1, 1, N, i, L[i]);
for(int i=2; i<=N; i++)
{
if(seg2.query1(1, 1, N, i, R[i-1]-1)>=i) Q[i]=0;
else Q[i]=seg2.query2(1, 1, N, i, R[i-1]-1, i);
seg4.update(1, 1, N, i-1, Q[i]);
}
scanf("%d", &QQ);
while(QQ--)
{
int x, y;
scanf("%d%d", &x, &y);
if(x<y)
{
if(seg3.query1(1, 1, N, x, y-1)<=x) printf("NO\n");
else printf("YES\n");
}
else
{
if(seg4.query1(1, 1, N, y, x-1)>=x) printf("NO\n");
else printf("YES\n");
}
}
}
