#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(int)a;i<(int)b;i++)
#define all(p) p.begin(),p.end()
using ll =long long;

template <class T> struct segtree {
    vector<T> t;
    vector<int> buf;
    segtree(int n) : t(2 * n), buf() {}
    void set(int i, T x) {
        i += t.size() / 2;
        t[i] = x;
        while (i /= 2) {
            t[i] = t[i * 2] + t[i * 2 + 1];
        }
    }
    T get(int l, int r) {
        T al, ar;
        l += t.size() / 2, r += t.size() / 2;
        while (l < r) {
            if (l & 1)
                al = al + t[l++];
            l >>= 1;
            if (r & 1)
                ar = t[--r] + ar;
            r >>= 1;
        }
        return al + ar;
    }
};

struct F{
    int val=-1;
    int cou=0;
    F operator+(F a){
        if(a.val>val) return a;
        if(a.val==val) cou+=a.cou;
        return *this;
    }
};

void solve(){
    int N;
    cin>>N;
    segtree<F> seg1(N);
    rep(i,0,N){
        int a;
        cin>>a;
        seg1.set(i,{a,1});
    }
    int M;
    cin>>M;
    segtree<F> seg2(M);
    rep(i,0,M){
        int a;
        cin>>a;
        seg2.set(i,{a,1});
    }
    int Q;
    cin>>Q;
    while(Q--){
        int t,x,y;
        cin>>t>>x>>y;
        x--;
        if(t==1) seg1.set(x,{y,1});
        if(t==2) seg2.set(x,{y,1});
        auto tmp1=seg1.t[1];
        auto tmp2=seg2.t[1];
        cout<<(tmp1.val==tmp2.val&&tmp1.cou==tmp2.cou?"YES\n":"NO\n");
    }
}

int main(){
    solve();
}