// Om Namah Shivaya
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a, b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a, b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
refs:
https://codeforces.com/blog/entry/51010
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
void solve(int test_case)
{
int n; cin >> n;
vector<int> c(n+5);
rep1(i,n-1) cin >> c[i];
vector<int> a[n+5];
rep1(i,n){
int k; cin >> k;
rep1(j,k){
ll x; cin >> x;
a[i].pb(x);
}
}
vector<int> left_pos(n+5,-1), right_pos(n+5,-1);
vector<int> pos(n+5);
rep1(i,n){
trav(x,a[i]){
pos[x] = i;
}
left_pos[i] = pos[c[i]];
}
fill(all(pos),n+1);
rev(i,n,1){
trav(x,a[i]){
pos[x] = i;
}
right_pos[i] = pos[c[i-1]];
}
vector<pii> ranges;
rep1(l,n){
// find first r s.t [l,r] becomes unextendable
for(int r = l; r < right_pos[l]; ++r){
if(left_pos[r] < l){
ranges.pb({l,r});
}
}
}
vector<pii> range(n+5,{1,n});
for(auto [l,r] : ranges){
int len1 = r-l+1;
for(int i = l; i <= r; ++i){
int len2 = range[i].ss - range[i].ff + 1;
if(len1 < len2){
range[i] = {l,r};
}
}
}
int q; cin >> q;
while(q--){
int x,y; cin >> x >> y;
auto [l,r] = range[x];
if(l <= y and y <= r){
yes;
}
else{
no;
}
}
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
