#include <bits/stdc++.h>
#define ent '\n'
#define int long long

using namespace std;
typedef long long ll;

const int maxn = 1e6 + 12;
const int mod = 998244353;

int pw[maxn], s[maxn];
int n, m, k;

string get(string s, string t) {
    string ans = "";
    for(int i = 0; i < n; i++) {
        if(s[i] == t[i]) {
            ans += s[i];
        }
        else {
            ans += 'J' + 'O' + 'I' - s[i] - t[i];
        }
    }
    return ans;
}

int t[maxn * 4], p[maxn * 4];

void build(int v, int tl, int tr) {
    p[v] = -1;
    if(tl == tr) {
        char c;
        cin >> c;
        t[v] = c - 'A' + 1;
        return;
    }
    int mid = tl + tr >> 1;
    build(v * 2, tl, mid);
    build(v * 2 + 1, mid + 1, tr);
    t[v] = (t[v * 2] * pw[tr - mid] + t[v * 2 + 1]) % mod;
}

void push(int v, int tl, int tr) {
    if(tl == tr || p[v] == -1) return;
    int mid = tl + tr >> 1;
    t[v * 2] = p[v] * s[mid - tl] % mod;
    t[v * 2 + 1] = p[v] * s[tr - mid - 1] % mod;
    p[v * 2] = p[v * 2 + 1] = p[v];
    p[v] = -1;
}

void upd(int v, int tl, int tr, int l, int r, int x) {
    push(v, tl, tr);
    if(tl > r || l > tr) return;
    if(tl >= l && tr <= r) {
        t[v] = x * s[tr - tl] % mod;
        p[v] = x;
        return;
    }
    int mid = tl + tr >> 1;
    upd(v * 2, tl, mid, l, r, x);
    upd(v * 2 + 1, mid + 1, tr, l, r, x);
    t[v] = (t[v * 2] * pw[tr - mid] + t[v * 2 + 1]) % mod;
}

void solve() {
    string a, b, c;
    cin >> n >> a >> b >> c;

    pw[0] = s[0] = 1;
    for(int i = 1; i <= n; i++) {
        pw[i] = pw[i - 1] * 29 % mod;
        s[i] = (s[i - 1] + pw[i]) % mod;
    }
    map<string, int> was;
    was[a] = was[b] = was[c] = 1;
    vector<string> v = {a, b, c};
    while(true) {
        int c = 0;
        for(int i = 0; i < v.size(); i++) {
            for(int  j = i + 1; j < v.size(); j++) {
                if(!was[get(v[i], v[j])]) {
                    v.push_back(get(v[i], v[j]));
                    c = 1;
                    was[v.back()] = 1;
                    break;
                }
            }
            if(c) break;
        }
        if(!c) break;
    }
    assert(v.size() <= 9);
    vector<int> ans;
    for(auto s : v) {
        int h = 0;
        for(char c : s) {
            h = h * 29 + c - 'A' + 1;
            h %= mod;
        }
        ans.push_back(h);
    }

    cin >> m;
    build(1, 1,n);


    auto query = [&]() -> void{
        bool fg = 0;
        for(auto x : ans) {
            if(x == t[1]) {
                fg = 1;
            }
        }
        if(fg) {
            cout << "Yes\n";
        }
        else {
            cout << "No\n";
        }
    };

    query();

    while(m--) {
        char x;
        int l, r;
        cin >> l >> r >> x;
        upd(1, 1, n, l, r, x - 'A' + 1);
        query();
    }
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
//     cin >> t;
    while(t--) {
        solve();
    }
}