#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << " " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << " " << j << " " << #i << " " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<long long,long long>pii;
typedef pair<int,pii>pi2;
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
vector<int>storage[500005];
bool f(int val, int l, int r){
int index=lower_bound(storage[val].begin(),storage[val].end(),l)-storage[val].begin();
//show3(val,val,l,l,r,r);
//show(sz,storage[val].size());
if(index==(int)storage[val].size()) return false;
//show2(index,index,storage[val][index],storage[val][index]);
if(storage[val][index]<=r) return true;
return false;
}
void solve(){
int n;
cin >> n;
int arr[n+1];
for(int x=1;x<n;x++){
cin >> arr[x];
}
int temp,temp2;
for(int x=1;x<=n;x++){
cin >> temp;
for(int y=0;y<temp;y++){
cin >> temp2;
storage[temp2].push_back(x);
}
}
pii ans[n+5];
memset(ans,-1,sizeof(ans));
for(int x=1;x<=n;x++){
int l=x;
int r=x;
while(1){
if(l!=1&&f(arr[l-1],l,r)){
l--;
if(ans[l].first!=-1){
r=max(r,ans[l].second);
l=min(l,ans[l].first);
}
}
else if(r!=n&&f(arr[r],l,r)){
r++;
}
else break;
}
ans[x]={l,r};
//show2(l,l,r,r);
}
int q;
cin >> q;
for(int x=0;x<q;x++){
cin >> temp >> temp2;
if(ans[temp].first<=temp2&&ans[temp].second>=temp2){
cout << "YES\n";
}
else cout << "NO\n";
}
}
int32_t main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
//freopen("in.txt","r",stdin);
//cin >> t;
while(t--){
solve();
}
}
