#include<bits/stdc++.h>
#define fir first
#define sec second
using namespace std;
constexpr int M=1e6+5;
vector<int>adj[M],vec;
int n,m,col[M];string str;
bool fl,flag;pair<int,int>a1[M],a2[M];
void dfs(int x,int c){
	col[x]=c;vec.push_back(x);
	for (auto y:adj[x])
		if (!~col[y]) dfs(y,!c);
		else if (col[x]==col[y])
			flag=0;
}
void solve(){ cin>>n>>m;
	for (int i=1;i<=n;i++) adj[i].clear(),col[i]=-1;
	for (int i=1;i<=m;i++){
		int x,y;cin>>x>>y;
		adj[x].push_back(y);
		adj[y].push_back(x);
	} fl=1;
	for (int i=1;i<=n;i++) cin>>a1[i].fir;
	cin>>str;str=" "+str;
	for (int i=1;i<=n;i++) a1[i].sec=str[i]=='R';
	for (int i=1;i<=n;i++) cin>>a2[i].fir;
	cin>>str;str=" "+str;
	for (int i=1;i<=n;i++) a2[i].sec=str[i]=='R';
	for (int i=1;i<=n&&fl;i++)
		if (!~col[i]){ int cnt=0;
			vec.clear();flag=1;dfs(i,0);
			for (auto x:vec)
				if (flag) a1[x].sec^=col[x],a2[x].sec^=col[x];	
				else cnt+=a1[x].sec-a2[x].sec,a1[x].sec=a2[x].sec=0;
			if (cnt&1) fl=0;
			vector<pair<int,int>>tmp1,tmp2;
			for (auto x:vec)
				tmp1.push_back(a1[x]),
				tmp2.push_back(a2[x]);
			sort(tmp1.begin(),tmp1.end());
			sort(tmp2.begin(),tmp2.end());
			for (int i=0;fl&&i<tmp1.size();i++)
				if (tmp1[i]!=tmp2[i])
					{fl=0;break;}
		}
	puts(fl?"YES":"NO");
}
int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int T;cin>>T;while (T--) solve();return 0;
}