#include<bits/stdc++.h>

#define ull unsigned long long
#define vc vector
#define pb emplace_back
#define pii pair<int, int>
#define mkp make_pair
#define rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define lep(i, a, b) for(int i = (a); i >= (b); --i)

using namespace std;

mt19937 gen(time(0));

inline int read() {
	int x = 0, w = 0; char ch = getchar(); while(!isdigit(ch)) w |= (ch == '-'), ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar(); return w ? -x : x; 
}

const int N = 2e5 + 5, lmt = 1e9;
const int P1 = 1e9 + 7, P2 = 998244353;
const int B1 = 1331, B2 = 42131;

int n, m;
int val[26], pw1[N], ps1[N], pw2[N], ps2[N];
string A, B, C, T;
map<string, bool> Map;
map<pii, bool> Hash;

inline string crossing(string s, string t) {
	string str; 
	rep(i, 0, n - 1) 
		if(s[i] == t[i]) str += s[i];
		else if(s[i] != 'J' && t[i] != 'J') str += 'J';
		else if(s[i] != 'O' && t[i] != 'O') str += 'O';
		else str += 'I';
	return str;
}

inline pii add(pii a, int v) {
	a.first = (1ll * B1 * a.first + v) % P1;
	a.second = (1ll * B2 * a.second + v) % P2;
	return a;
}

inline pii Add(pii a, pii b) {
	a.first = (a.first + b.first) % P1;
	a.second = (a.second + b.second) % P2;
	return a;
}

inline pii shift(pii a, int v) {
	a.first = 1ll * a.first * pw1[v] % P1;
	a.second = 1ll * a.second * pw2[v] % P2;
	return a;
}

inline pii get(int len, int v) {
	pii res;
	res.first = 1ll * v * ps1[len] % P1;
	res.second = 1ll * v * ps2[len] % P2;
	return res;
}

inline pii gethash(string s) {
	pii hs;
	rep(i, 0, n - 1) hs = add(hs, val[s[i] - 'A']);
	return hs;
}

inline void bfs() {
	queue<string> Q;
	Q.push(A); Q.push(B); Q.push(C);
	Map[A] = Map[B] = Map[C] = 1;
	while(!Q.empty()) {
		auto s = Q.front(); Q.pop(); 
		Hash[gethash(s)] = 1;
		vc<string> cur;
		for(auto u: Map) {
			string str = crossing(u.first, s);
			if(!Map[str]) cur.pb(str);
		}
		for(auto u: cur) Map[u] = 1, Q.push(u);
	}
}

namespace sgt {
	pii tre[N << 2]; int cov[N << 2];
	#define mid (l + r >> 1)
	#define ls (k << 1)
	#define rs (k << 1 | 1)
	inline void psu(int k, int l, int r) {
		tre[k] = Add(shift(tre[ls], r - mid), tre[rs]);
	}
	inline void ps(int k, int l, int r, int v) {
		cov[k] = v; tre[k] = get(r - l, v);
	}
	inline void psd(int k, int l, int r) {
		if(cov[k]) ps(ls, l, mid, cov[k]), ps(rs, mid + 1, r, cov[k]);
		cov[k] = 0;		
	}
	inline void build(int k, int l, int r) {
		if(l == r) return tre[k] = get(0, val[T[l - 1] - 'A']), void();
		build(ls, l, mid); build(rs, mid + 1, r); psu(k, l, r);
	}
	inline void cover(int k, int l, int r, int L, int R, int v) {
		if(L > R || L > r || R < l) return ;
		if(L <= l && R >= r) return ps(k, l, r, v); psd(k, l, r);
		cover(ls, l, mid, L, R, v); cover(rs, mid + 1, r, L, R, v); psu(k, l, r);
	}
}
using namespace sgt;

signed main() {
	n = read();
	
	rep(i, 0, 25) val[i] = gen() % lmt;
	pw1[0] = pw2[0] = ps1[0] = ps2[0] = 1;
	rep(i, 1, n) {
		pw1[i] = 1ll * pw1[i - 1] * B1 % P1; ps1[i] = (ps1[i - 1] + pw1[i]) % P1;
		pw2[i] = 1ll * pw2[i - 1] * B2 % P2; ps2[i] = (ps2[i - 1] + pw2[i]) % P2;
	}
	
	cin >> A >> B >> C;
	bfs();
	
	m = read(); cin >> T;
	build(1, 1, n);
	puts(Hash.count(tre[1]) ? "Yes" : "No");
	for(int t = 1, l, r; t <= m; t++) {
		l = read(); r = read(); char ch = getchar();
		cover(1, 1, n, l, r, val[ch - 'A']); 
		puts(Hash.count(tre[1]) ? "Yes" : "No");
	}
	return 0;
}