//A tree without skin will surely die.
//A man without face will be alive.
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rep(i,j,k) for(int i=j;i<=k;++i)
#define per(i,j,k) for(int i=j;i>=k;--i)
int const N=1e6+10;
int n,m,a[N],b[N],co[N],G;
string A,B;vector<int>e[N];
inline bool g(char X){return (X=='R');}
vector< pair<int,int> >v1,v2;
inline void dfs(int x,int Co,int &co1,int &co2){
	co1^=g(A[x]),co2^=g(B[x]),co[x]=Co;
	v1.push_back({a[x],Co^g(A[x])}),v2.push_back({b[x],Co^g(B[x])});
	for (auto v:e[x])
		if (co[v]==-1){
			dfs(v,Co^1,co1,co2);
		}else if (co[v]==Co) G=1;
}
inline void solve(){
	cin>>n>>m;
	rep(i,1,n) co[i]=-1,e[i].clear();
	rep(i,1,m){
		int u,v;cin>>u>>v;
		e[u].push_back(v);
		e[v].push_back(u);
	}
	rep(i,1,n) cin>>a[i];
	cin>>A,A=" "+A;
	rep(i,1,n) cin>>b[i];
	cin>>B,B=" "+B;
	rep(i,1,n){
		if (co[i]!=-1) continue;
		int co1=0,co2=0;
		G=0,v1.clear(),v2.clear(),dfs(i,0,co1,co2);
		if (co1!=co2) return cout<<"NO\n",void();
		sort(all(v1)),sort(all(v2));
		if (!G && v1!=v2) return cout<<"NO\n",void();
		int sz=v1.size();
		rep(j,0,sz-1)
			if (v1[j].first!=v2[j].first) return cout<<"NO\n",void();
	}
	cout<<"YES\n";
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	int t=1;
	cin>>t;
	while (t--) solve();
	return 0;
}