#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return __lg(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T& container, string separator = " ", string finish = "\n"){
for(auto item: container) cout << item << separator;
cout << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
const int INF = 1e9 + 69;
struct SegmentTreeMax{
int n;
vector<int> a;
SegmentTreeMax(int _n){
n = _n;
a.resize(n * 2 + 2, -INF);
}
int get(int i){
i += n;
int ans = -INF;
while(i > 0){
maximize(ans, a[i]);
i >>= 1;
}
return ans;
}
void update(int l, int r, int v){
l += n; r += n + 1;
while(l < r){
if (l & 1) maximize(a[l++], v);
if (r & 1) maximize(a[--r], v);
l >>= 1; r >>= 1;
}
}
};
struct SegmentTreeMin{
int n;
vector<int> a;
SegmentTreeMin(int _n){
n = _n;
a.resize(n * 2 + 2, INF);
}
int get(int i){
i += n;
int ans = INF;
while(i > 0){
minimize(ans, a[i]);
i >>= 1;
}
return ans;
}
void update(int l, int r, int v){
l += n; r += n + 1;
while(l < r){
if (l & 1) minimize(a[l++], v);
if (r & 1) minimize(a[--r], v);
l >>= 1; r >>= 1;
}
}
};
void solve(){
int n; cin >> n;
vector<int> c(n+1);
for(int i = 1; i < n; ++i) cin >> c[i];
vector<vector<int>> a(n+1);
for(int i = 1; i <= n; ++i){
int b; cin >> b;
a[i].resize(b);
for(int j = 0; j < b; ++j) cin >> a[i][j];
}
vector<vector<int>> pos_room(n+1);
vector<vector<int>> pos_door(n+1);
for(int i = 1; i <= n; ++i) {
pos_room[i].push_back(0);
pos_door[i].push_back(0);
}
for(int i = 1; i <= n; ++i){
for(int j: a[i]) pos_room[j].push_back(i);
if (i < n) {
pos_door[c[i]].push_back(i);
}
}
for(int i = 1; i <= n; ++i) {
pos_room[i].push_back(n+1);
pos_door[i].push_back(n);
}
SegmentTreeMax L(n);
SegmentTreeMin R(n);
L.update(1, n, 1); R.update(1, n, n);
for(int i = 1; i <= n; ++i){
for(int j = 0; j + 1 < (int) pos_room[i].size(); ++j){
int l = pos_room[i][j], r = pos_room[i][j+1];
int x = lower_bound(ALL(pos_door[i]), l) - pos_door[i].begin();
int y = lower_bound(ALL(pos_door[i]), r) - pos_door[i].begin() - 1;
for(int k = x; k < y; ++k){
int _l = pos_door[i][k], _r = pos_door[i][k+1];
L.update(_l + 1, _r, _l + 1);
R.update(_l + 1, _r, _r);
}
}
}
vector<pair<int,int>> ans(n+1);
for(int i = 1; i <= n; ++i) ans[i] = make_pair(L.get(i), R.get(i));
int q; cin >> q;
while(q--){
int x, y; cin >> x >> y;
pair<int, int> cur = ans[x];
if (cur.first <= y && y <= cur.second) cout << "YES\n";
else cout << "NO\n";
}
}
int main(void){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
clock_t start = clock();
solve();
cerr << "Time elapsed: " << clock() - start << "ms!\n";
return 0;
}
