// Lynkcat.
// Problem: #2397. 「JOISC 2017 Day 3」幽深府邸
// URL: https://loj.ac/p/2397
// Memory Limit: 256 MB
// Time Limit: 3000 ms
// -----------------------------------------------

//我耳朵瞎掉拉~~
#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define int ll
#define N 500005
using namespace std;
int n,c[N],l[N],r[N];
poly G[N],E[N];
int m;
int query(int x,int l,int r)
{
	return (lower_bound(G[x].begin(),G[x].end(),l)-G[x].begin())!=(lower_bound(G[x].begin(),G[x].end(),r+1)-G[x].begin());
}
void BellaKira()
{
	cin>>n;
	for (int i=1;i<n;i++)
		cin>>c[i];
	for (int i=1;i<=n;i++)
	{
		int x;
		cin>>x;
		while (x--)
		{
			int y;
			cin>>y;
			G[y].push_back(i);
			E[i].push_back(y);
		}
	}
	r[n]=n;
	for (int i=n-1;i>=1;i--)
	{
		r[i]=i;
		while (r[i]<n&&query(c[r[i]],i,r[i]))
		{
			r[i]=r[r[i]+1];
		}
	}
	l[1]=1;
	for (int i=2;i<=n;i++)
	{
		l[i]=i;
		while (l[i]>1&&query(c[l[i]-1],l[i],i))
		{
			l[i]=l[l[i]-1];
		}
	}
	for (int i=2;i<=n;i++)
	{
		l[i]=i;
		while ((l[i]>1&&query(c[l[i]-1],l[i],r[i]))||(r[i]<n&&query(c[r[i]],l[i],r[i])))
		{
			if ((l[i]>1&&query(c[l[i]-1],l[i],r[i])))
			{
				r[i]=max(r[i],r[l[i]-1]);
				l[i]=l[l[i]-1];
			}
			if ((r[i]<n&&query(c[r[i]],l[i],r[i])))
			{
				l[i]=min(l[i],l[r[i]+1]);
				r[i]=r[r[i]+1];
			}
		}
	}
	cin>>m;
	for (int i=1;i<=m;i++)
	{
		int x,y;
		cin>>x>>y;
		if (l[x]<=y&&y<=r[x]) cout<<"YES"<<'\n';
		else cout<<"NO"<<'\n';
	}
}
signed main()
{
	IOS;
	int T=1;
	while (T--)
	{
		BellaKira();
	}
}