#include<bits/stdc++.h>
using namespace std;
bool M1;
#define PI 3.14159265358979323846
#define sz(a) (int)a.size()
#define all(x) x.begin(),x.end()
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define se second
#define fi first
#define ffi fi.fi
#define sfi se.fi
#define int long long
#define sse se.se
#define fse fi.se
#define lt(i, c, d) for(int i = c; i <= d; ++i)
#define fl(i, c, d) for(int i = d; i >= c; --i)
#define pb push_back
#define emb emplace_back
#define emf emplace_front
#define em emplace
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<'\n'
#define look_time cerr << "TIME : " << clock() * 0.001 << "s" <<'\n'
const int N=1e6+5,lg=30,mod=1e9+7;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int u,int v){
return u+rd()%(v-u+1);
}
int dx[]={1,0,-1,0,1,1,-1,-1};
int dy[]={0,-1,0,1,1,-1,1,-1};
int node,m,a[N],col[N],k[N],l[N],r[N];
vector<int>mau[N];
struct segmin {
int n;
vector<int> st, lazy;
segmin() {};
segmin(int _n): n(_n), st(n * 4 + 5, 0), lazy(n * 4 + 5, 0) {};
void build(int id, int l, int r) {
if (l == r) {
st[id] = a[l];
return;
}
int mid = (l + r) >> 1;
build(id << 1, l, mid);
build(id << 1 | 1, mid + 1, r);
st[id] = min(st[id << 1], st[id << 1 | 1]);
}
int getright(int id, int l, int r, int u, int v, int val) {
// cout <<l<<" "<<r<<" "<<st[id]<<" "<<val<<'\n';
if (st[id] >= val || r < u || l > v) return -1;
if (l == r) return l-1;
int mid = (l + r) >> 1;
int R = getright(id << 1, l, mid, u, v, val);
if (R == -1)
return getright(id << 1 | 1, mid + 1, r, u, v, val);
return R;
}
};
bool check(int u,int v,int colo){
auto it=lower_bound(all(mau[colo]),u);
return it!=mau[colo].end()&&*it<=v;
}
bool M2;
void solve(){
cin >> node;
for(int i=2;i<=node;++i)cin >> col[i];
for(int i=1;i<=node;++i){
cin >> k[i];
for(int j=1;j<=k[i];++j){
int x;
cin >> x;
mau[x].emb(i);
// cout <<x<<" ";
}
// cout << col[i+1]<<'\n';
a[i+1]=mau[col[i+1]].empty()?0:mau[col[i+1]].back();
}
// for(int i=1;i<=node;++i)cout << a[i]<<" ";cout<<'\n';
segmin seg(node);
seg.build(1,1,node+1);
for(int i=1;i<=node;++i){
l[i]=r[i]=i;
while(true){
r[i]=max(r[i],seg.getright(1,1,node+1,r[i]+1,node+1,l[i]));
if(check(l[i],r[i],col[l[i]])){
r[i]=max(r[i],r[l[i]-1]);
l[i]=l[l[i]-1];
}
else break;
}
// cout <<l[i]<<" "<<r[i]<<'\n';
}
int query;
cin >> query;
while(query--){
int u,v;
cin >> u >> v;
if(l[u]<=v&&v<=r[u])cout <<"YES";
else cout <<"NO";cout<<'\n';
}
}
main()
{
srand(time(0));
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#define task "aws"
if(fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
int t=1;
// cin >> t;
while(t--){
solve();
}
look_memory;
look_time;
}
