#include<bits/stdc++.h>
using namespace std;
#define foru(i,a,b) for(int i=(a); i<=(b); ++i)
#define ford(i,a,b) for(int i=(a); i>=(b); --i)
#define rep(i,a) for(int i=0; i<(a); ++i)
#define sz(a) (int)(a).size()
#define all(a) (a).begin(),(a).end()
#define bit(s,i) (((s)>>(i))&1)
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define fi first
#define se second
#define ll long long
#define eb emplace_back
#define pb push_back
#define __builtin_popcount __builtin_popcountll
#define _ << " " <<
template <class X, class Y> bool maxi(X &x, Y y){return x<y?x=y,true:false;}
template <class X, class Y> bool mini(X &x, Y y){return x>y?x=y,true:false;}
const int N=5e5+5;
int n,c[N],l[N],r[N];
vector<int> v[N];
bool chk(int l, int r, int x){
auto it=lower_bound(all(v[x]),l);
return it!=v[x].end() && *it<=r;
}
void solve(){
cin>>n;
foru(i,1,n-1) cin>>c[i];
foru(i,1,n){
int x; cin>>x;
foru(j,1,x){
int y; cin>>y;
v[y].eb(i);
}
}
foru(i,1,n){
l[i]=r[i]=i;
while(true){
if(l[i]>1 && chk(l[i],r[i],c[l[i]-1])){
r[i]=max(r[i],r[l[i]-1]);
l[i]=l[l[i]-1];
} else{
if(chk(l[i],r[i],c[r[i]])){
++r[i];
} else{
break;
}
}
}
}
int q; cin>>q;
rep(i,q){
int x,y; cin>>x>>y;
cout<<((l[x]<=y&&y<=r[x])?"YES":"NO")<<'\n';
}
}
int32_t main(){
#define task "test"
if(fopen(task".inp", "r")){
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
cin.tie(0)->sync_with_stdio(0);
int tc=1; //cin>>tc;
foru(i,1,tc){
solve();
}
}
