#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define mt make_tuple
#define mp make_pair
#define int long long
#define f first
#define s second
#define pll pair<long long, long long>
#define iii tuple<int,int,int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define pb push_back
struct node{
int s, e, m, v;
node *l, *r;
node (int S, int E, vector<int> & V){
s=S,e=E,m=(s+e)/2;
if(s==e){
v=V[s];
}
else{
l=new node(s, m, V);
r=new node(m+1, e, V);
v=min(l->v, r->v);
}
}
int bs(int S, int E, int LIM){
if(v >= LIM) return -1;
if(s==e){
if(v < LIM) return s;
return -1;
}
if(S > m) return r->bs(S, E, LIM);
if(E <= m)return l->bs(S, E, LIM);
int ret=l->bs(S,m,LIM);
if(ret == -1) return r->bs(m+1, E, LIM);
return ret;
}
}*root;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;cin>>n;
vector<int> ed(n+1, 0);
vector<vector<int>> keys(n+1);
for(int i=1;i<=n-1;i++){
cin>>ed[i];
}
for(int i=1;i<=n;i++){
int k;cin>>k;
for(int j=0;j<k;j++){
int cur;cin>>cur;
keys[i].pb(cur);
}
}
vector<int> nblk(n+1, n), nkey(n+1, 1e15), rightonly(n+1, 0), rreq(n+1, 1e15);
iota(all(rightonly), 0);
multiset<int> ms;
for(int i=1;i<=n;i++) ms.insert(n);
for(int i=n;i>=1;i--){
for(auto key : keys[i]){
if(nblk[key] != n) {
ms.erase(ms.find(nblk[key]));
nblk[key] = n;
ms.insert(n);
}
nkey[key]=i;
}
rightonly[i]=*ms.begin();
rreq[i-1]=nkey[ed[i-1]];
if(i != 1) ms.erase(ms.find(nblk[ed[i-1]]));
nblk[ed[i-1]]=i-1;
ms.insert(i-1);
}
vector<int> lreq(n+1, -1e15);
fill(all(nblk), 0); fill(all(nkey), -1e15);
ms.clear();
for(int i=1;i<=n;i++) ms.insert(0);
for(int i=1;i<=n;i++){
for(auto key : keys[i]){
if(nblk[key] != 0) {
ms.erase(ms.find(nblk[key]));
nblk[key] = 0;
ms.insert(0);
}
nkey[key]=i;
}
lreq[i]=nkey[ed[i]];
if(i != n) ms.erase(ms.find(nblk[ed[i]]));
nblk[ed[i]]=i;
ms.insert(i);
}
root= new node(1, n, lreq);
//cout<<root->bs(3, n, 2);
//return 0;
/*for(int i=1;i<=n;i++){
printf("i %lld lreq %lld, rreq %lld\n", i, lreq[i], rreq[i]);
}*/
vector<int> l(n+1), r(n+1);
iota(all(l), 0);
iota(all(r), 0);
for(int i=1;i<=n;i++){
int cl=i, cr=rightonly[i];
while(rreq[cl-1] <= cr){
cr=max(r[cl-1], cr);
cl=min(l[cl-1], cl);
int nxtr=root->bs(cr+1, n, cl);
//printf("i %lld, cr %lld, cl %lld, nxtr %lld\n", i, cr, cl, nxtr);
assert(nxtr >= cr);
cr=nxtr;
}
l[i]=cl, r[i]=cr;
}
/*for(int i=1;i<=n;i++){
printf("i %lld l %lld, r %lld\n", i, l[i], r[i]);
}*/
int q;cin>>q;
for(int qind=0;qind<q;qind++){
int s, t;cin>>s>>t;
if(l[s] <= t and t <= r[s]){
cout<<"YES\n";
}
else cout<<"NO\n";
}
}
