#include <bits/stdc++.h>
#define F for(int i = 1; i <= n; i++)
#define S(p) sort(p.begin(), p.end())
using namespace std;
const int N = 500005;
int T, n, m, fcl, cnt1, cnt2, a[N], b[N], vis[N], cl[N];
vector <int> e[N], p, q, v1[2], v2[2];
char c1[N], c2[N];
void dfs(int x){
	p.push_back(a[x]), q.push_back(b[x]);
	v1[(c1[x] == 'R') ^ cl[x]].push_back(a[x]), v2[(c2[x] == 'R') ^ cl[x]].push_back(b[x]);
	vis[x] = 1, cnt1 += c1[x] == 'R', cnt2 += c2[x] == 'R';
	for(int i: e[x]) if(!vis[i]) cl[i] = cl[x] ^ 1, dfs(i);
	else if(cl[i] == cl[x]) fcl = 1;
}
int solve(int x){
	for(int i: {0, 1}) v1[i].clear(), v2[i].clear();
	p.clear(), q.clear(), cl[x] = cnt1 = cnt2 = fcl = 0, dfs(x); S(p), S(q);
	for(int i = 0; i < p.size(); i++) if(p[i] != q[i]) return 0;
	if(fcl) return !(cnt1 - cnt2 & 1);
	for(int i: {0, 1}){
		S(v1[i]), S(v2[i]);
		if(v1[i].size() != v2[i].size()) return 0;
		for(int j = 0; j < v1[i].size(); j++) if(v1[i][j] != v2[i][j]) return 0;
	}
	return 1;
}
int main(){
	cin >> T;
	while(T--){
		cin >> n >> m; int fl = 1;
		F e[i].clear(), vis[i] = 0;
		for(int i = 1, u, v; i <= m; i++) cin >> u >> v, e[u].push_back(v), e[v].push_back(u);
		F cin >> a[i];
		F cin >> c1[i];
		F cin >> b[i];
		F cin >> c2[i];
		F if(!vis[i]) fl &= solve(i);
		cout << (fl? "YES\n": "NO\n");
	}
	return 0;
}