#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = (int)1e6 + 12, MOD = 998244353, p = 331;

int t[N * 4][3], nd[N * 4][3], ok[N];
int n, q;
string a, s;

void merge(int v) {
    ok[v] = (ok[v + v] & ok[v + v +1]);
    for(int i = 0; i < 3; i++) {
        t[v][i] = t[v + v][i] + t[v + v + 1][i];
        nd[v][i] = nd[v + v][i] + nd[v + v + 1][i];
        if(t[v][i] != nd[v][i]) {
            ok[v] = 0;
        }
    }
}
int conv(char x) {
    if(x == 'J') return 0;
    if(x == 'O') return 1;
    return 2;
}
int mod[N * 4];
void build(int v = 1, int tl = 0, int tr = n - 1) {
    mod[v] = -1;
    if(tl == tr) {
        t[v][conv(s[tl])] = 1;
        nd[v][conv(a[tl])] = 1;
        ok[v] = (s[tl] == a[tl]);
    } else {
        int tm = (tl + tr) >> 1;
        build(v + v, tl, tm);
        build(v + v + 1, tm + 1, tr);
        merge(v);
    }
}

void assign(int v, int tl, int tr, int val) {
    t[v][0] = t[v][1] = t[v][2] = 0;
    t[v][val] = (tr - tl + 1);
    ok[v] = (nd[v][val] == t[v][val]);
    mod[v] = val;
}
void push(int v, int tl, int tr) {
    if(tl != tr && mod[v] != -1) {
        int tm = (tl + tr) >> 1;
        assign(v + v, tl, tm, mod[v]);
        assign(v + v + 1, tm + 1, tr, mod[v]);
    }
    mod[v] = -1;
}
void upd(int l, int r, int val, int v = 1, int tl = 0, int tr = n - 1) {
    if(l > r || tl > r || l > tr) return;
    if(tl >= l && tr <= r) {
        assign(v, tl, tr, val);
    } else {
        push(v, tl, tr);
        int tm = (tl + tr) >> 1;
        upd(l, r, val, v + v, tl, tm);
        upd(l, r, val, v + v + 1, tm + 1, tr);
        merge(v);
        // cout << v << ' ' << tl << ' ' << tr << ' ' << ok[v + v + 1] << '\n';
    }
}
void out() {
    cout << (ok[1] ? "Yes\n" : "No\n");
}
void test() {
    cin >> n >> a >> a >> a;
    cin >> q >> s;
    build();
    out();
    while(q--) {
        int l, r;
        char f;
        cin >> l >> r >> f;
        l--;r--;
        upd(l, r, conv(f));
        out();
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t = 1;
    //cin >> t;

    while(t--)
        test();

    return 0;
}