#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);
}
void update(int i, int v){
i += n; if (!maximize(a[i], v)) return;
while(i > 1){
i >>= 1;
a[i] = max(a[i * 2], a[i * 2 + 1]);
}
}
int get(int l, int r){
l += n; r += n + 1;
int ans = -INF;
while(l < r){
if (l & 1) maximize(ans, a[l++]);
if (r & 1) maximize(ans, a[--r]);
l >>= 1; r >>= 1;
}
return ans;
}
};
struct SegmentTreeMin{
int n;
vector<int> a;
SegmentTreeMin(int _n){
n = _n;
a.resize(n * 2 + 2, INF);
}
void update(int i, int v){
i += n; if (!minimize(a[i], v)) return;
while(i > 1){
i >>= 1;
a[i] = min(a[i * 2], a[i * 2 + 1]);
}
}
int get(int l, int r){
l += n; r += n + 1;
int ans = INF;
while(l < r){
if (l & 1) minimize(ans, a[l++]);
if (r & 1) minimize(ans, a[--r]);
l >>= 1; r >>= 1;
}
return ans;
}
};
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);
}
SegmentTreeMin L(n);
SegmentTreeMax R(n);
for(int i = 1; i <=n; ++i) {
L.update(i, i); R.update(i, i);
}
vector<int> perm(n);
for(int i = 0; i < n; ++i) perm[i] = i + 1;
shuffle(ALL(perm), rng);
for(int i: perm){
int l = i, r = i;
while(true){
int updated = 0;
updated += minimize(l, L.get(l, r));
updated += maximize(r, R.get(l, r));
if (l > 1){
if (upper_bound(ALL(pos_room[c[l-1]]), r) - lower_bound(ALL(pos_room[c[l-1]]), l) > 0){
l--;
updated++;
}
}
if (r < n){
if (upper_bound(ALL(pos_room[c[r]]), r) - lower_bound(ALL(pos_room[c[r]]), l) > 0){
r++;
updated++;
}
}
if (updated == false) break;
}
L.update(i, l);
R.update(i, r);
}
vector<pair<int,int>> ans(n+1);
for(int i = 1; i <= n; ++i) ans[i] = make_pair(L.get(i, i), R.get(i, i));
// for(int i = 1; i <= n; ++i) cout << ans[i].first << " " << ans[i].second << "\n";
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;
}
