#include <bits/stdc++.h>
#define REP(i, l, r) for (int i = (l); i <= (r); ++ i)
#define DEP(i, r, l) for (int i = (r); i >= (l); -- i)
#define fi first
#define se second
#define pb emplace_back
#define mems(x, v) memset((x), (v), sizeof(x))
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(), (x).end()
using namespace std;
namespace Milkcat {
	typedef long long LL;
	typedef pair<LL, LL> pii;
	const int N = 2e6 + 5;
	int n, m, u, v, chk, a[N], b[N], A[N], B[N], c[N], vs[N]; vector<int> s, G[N]; char x;
	void color(int u, int& chk) {
		s.pb(u);
		for (int v : G[u]) {
			if (c[v] < 0) c[v] = c[u] ^ 1, color(v, chk);
			else chk &= (c[u] != c[v]);
		}
	}
	int W(int x, int t) {
		return (t ? A[x] : a[x]) + (t ? B[x] ^ c[x] : b[x] ^ c[x]) * 1e6;
	}
	int main() {
		cin >> n >> m, chk = 1;
		REP(i, 1, m) cin >> u >> v, G[u].pb(v), G[v].pb(u);
		REP(i, 1, n) cin >> a[i];
		REP(i, 1, n) cin >> x, b[i] = (x == 'R');
		REP(i, 1, n) cin >> A[i], c[i] = -1;
		REP(i, 1, n) cin >> x, B[i] = (x == 'R');
		REP(i, 1, n) {
			if (c[i] != -1) continue;
			int bip = 1, ct = 0;
			c[i] = 0, s.clear(), color(i, bip);
			if (bip) {
				for (int x : s) {
					int p = W(x, 0), q = W(x, 1);
					if (!vs[p] ++) ct ++;
					if (!-- vs[q]) ct --;
				}
				chk &= !ct;
				for (int x : s)
					vs[W(x, 0)] = vs[W(x, 1)] = 0;
			} else {
				int P = 0;
				for (int x : s) {
					if (!vs[a[x]] ++) ct ++;
					if (!-- vs[A[x]]) ct --;
					P ^= b[x] ^ B[x];
				}
				chk &= (!ct && !P);
				for (int x : s)
					vs[a[x]] = vs[A[x]] = 0;
			}
		}
		cout << (chk ? "YES" : "NO") << '\n';
		REP(i, 1, n) G[i].clear();
		return 0;
	}
}
int main() {
	// freopen("graph.in", "r", stdin);
	// freopen("graph.out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int T = 1; cin >> T;
	while (T --) Milkcat::main();
	return 0;
}