#include <bits/stdc++.h>
using namespace std;

const int N = 1e6 + 5,Lim = 1e6 + 1;
int n,m;
int A[N],B[N],ac[N],bc[N];
int vst[N];
bool FLG = false;
map<int,int> mp1,mp2;
int num_c;
int fir[N],nxt[N << 1],to[N << 1],ect = 1;
inline void addedge(int u1,int v1) {
	nxt[++ect] = fir[u1];fir[u1] = ect;to[ect] = v1;
}
int co[N];
void dfs(int x,int col) {
	vst[x] = true;
	mp1[(col ^ ac[x]) * Lim + A[x]]++;
	mp1[(col ^ bc[x]) * Lim + B[x]]--;
	mp2[A[x]]++;mp2[B[x]]--;
	num_c += ac[x];num_c -= bc[x];
	co[x] = col;
	for(int i = fir[x],y;y = to[i],i;i = nxt[i])
		if(!vst[y]) dfs(y,col ^ 1);
		else if(co[y] == co[x]) FLG = true;
}
inline void work() {
	ect = 1;
	for(int i = 1;i <= n;i++) fir[i] = vst[i] = co[i] = 0;
	cin >> n >> m;
	for(int i = 1,u,v;i <= m;i++)
		cin >> u >> v,addedge(u,v),addedge(v,u);
	for(int i = 1;i <= n;i++) cin >> A[i];
	string str;
	cin >> str;
	for(int i = 1;i <= n;i++) ac[i] = str[i - 1] == 'R';
	for(int i = 1;i <= n;i++) cin >> B[i];
	cin >> str;
	for(int i = 1;i <= n;i++) bc[i] = str[i - 1] == 'R';
	for(int i = 1;i <= n;i++) if(!vst[i]) {
		FLG = false;num_c = 0;
		mp1.clear();mp2.clear();
		dfs(i,0);
		if(FLG) {
			if((num_c & 1)) return puts("NO"),void();
			for(auto it : mp2) if(it.second != 0) return puts("NO"),void();
		} else {
			// printf("mp1: ");
			// for(auto it : mp1) printf("(%d,%d) ",it.first,it.second);printf("\n");
			for(auto it : mp1) if(it.second != 0) return puts("NO"),void();
		}
	}
	puts("YES");
}
int main() {
	int T;
	cin >> T;
	while(T--) work();
	return 0;
}