#include<bits/stdc++.h>
using namespace std;
#define sz(v) (int)v.size()
#define all(v) begin(v), end(v)
#define compact(v) v.erase(unique(all(v)), end(v))
#define dbg(v) "[" #v " = " << (v) << "]"
#define file(name) if(fopen(name".inp", "r")) {freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define rep(i, l, r) for(int i = (l); i < (r); ++i)
using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using ld = long double;
template<typename T>
bool minimize(T& a, const T& b){
if(a > b){
return a = b, true;
} return false;
}
template<typename T>
bool maximize(T& a, const T& b){
if(a < b){
return a = b, true;
} return false;
}
template<int dimension, typename T>
struct tensor : public vector<tensor<dimension - 1, T>> {
static_assert(dimension > 0, "Dimension must be positive !\n");
template<typename... Args>
tensor(int n = 0, Args... args) : vector<tensor<dimension - 1, T>> (n, tensor<dimension - 1, T>(args...)) {}
};
template<typename T>
struct tensor<1, T> : public vector<T> {
tensor(int n = 0, T val = T()) : vector<T>(n, val) {}
};
const int MAX = 5e5 + 5;
int n, q, k[MAX], c[MAX], lastOcc[MAX], requireLeft[MAX], requireRight[MAX], l[MAX], r[MAX];
vector<int> a[MAX];
bool can_extend(int l, int r, int pos){
return (requireLeft[pos] != 0 && l <= requireLeft[pos] && requireLeft[pos] <= r) || (requireRight[pos] != n + 1 && l <= requireRight[pos] && requireRight[pos] <= r);
}
void testcase(){
cin >> n;
rep(i, 1, n) cin >> c[i];
rep(i, 1, n + 1){
cin >> k[i];
a[i].resize(k[i]);
rep(j, 0, k[i]){
cin >> a[i][j];
}
}
rep(i, 1, n){
rep(j, 0, k[i]){
lastOcc[a[i][j]] = i;
}
requireLeft[i] = lastOcc[c[i]]; //from i + 1 to i
}
rep(i, 1, n + 1) lastOcc[i] = n + 1;
requireRight[n] = n + 1;
for(int i = n; i > 1; --i){
rep(j, 0, k[i]){
lastOcc[a[i][j]] = i;
}
requireRight[i - 1] = lastOcc[c[i - 1]]; //from i to i + 1
}
rep(i, 1, n + 1){
int l = i, r = i;
while(true){
//can extend
if(l > 1 && can_extend(l, r, l - 1)){
--l;
maximize(r, ::r[l]);
minimize(l, ::l[l]);
} else if(r < n && can_extend(l, r, r)){
++r;
} else break;
}
::l[i] = l;
::r[i] = r;
}
cin >> q;
rep(_, 0, q){
int x, y;
cin >> x >> y;
if(l[x] <= y && y <= r[x]){
cout << "YES\n";
} else cout << "NO\n";
}
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
file("task");
int T = 1;
// cin >> T;
while(T--){
testcase();
}
return 0;
}
