#include <bits/stdc++.h>
using namespace std;
#define fo(v,a,b) for(int v=a;v<=b;v++)
#define fr(v,a,b) for(int v=a;v>=b;v--)
#define cl(a,v) memset(a,v,sizeof(a))

const int N = 1000010;

int n, m; vector<int> g[N];
int a[N], b[N]; char c[N], d[N];

int va[N], vb[N], cntA, cntB;

namespace N5 {
	typedef array<int, 5> sta;
	sta S, T; set<sta> Vis; queue<sta> q;
	bool gr[10][10];
	void solve() {
		while(q.size()) q.pop(); Vis.clear(), cl(gr, 0);
		fo(x,1,n) for(int y : g[x]) gr[x][y] = true;
		fo(i,1,5) S[i - 1] = T[i - 1] = 0;
		fo(i,1,n) {
			S[i - 1] = (c[i] == 'R' ? 1 : -1) * a[i];
			T[i - 1] = (d[i] == 'R' ? 1 : -1) * b[i];
		}
		
		Vis.insert(S), q.push(S);
		while(q.size()) {
			auto now = q.front(); q.pop();
			if(now == T) return puts("YES"), void();
			fo(x,1,n) fo(y,1,n) if(gr[x][y]) {
				auto nxt = now;
				int v1 = abs(nxt[x - 1]), d1 = nxt[x - 1] / v1;
				int v2 = abs(nxt[y - 1]), d2 = nxt[y - 1] / v2;
				if(d1 == d2) d1 *= -1, d2 *= -1;
				nxt[x - 1] = v2 * d1, nxt[y - 1] = v1 * d2;
				if(Vis.find(nxt) == Vis.end())
					Vis.insert(nxt), q.push(nxt);
			}
		} puts("NO");
	}
}

void reset() {
	cntA = cntB = 0; fo(i,1,n) g[i].clear();
}
void solve() {
	scanf("%d%d", &n, &m), reset();
	fo(i,1,m) {
		int u, v; scanf("%d%d", &u, &v);
		assert(u != v);
		g[u].push_back(v), g[v].push_back(u);
	}
	fo(i,1,n) scanf("%d", &a[i]), a[i]++, va[i] = a[i];
	scanf("%s", c + 1); fo(i,1,n) cntA += (c[i] == 'R');

	fo(i,1,n) scanf("%d", &b[i]), b[i]++, vb[i] = b[i];
	scanf("%s", d + 1); fo(i,1,n) cntB += (c[i] == 'R');

	if((cntA & 1) != (cntB & 1)) return puts("NO"), void();
	sort(va + 1, va + n + 1), sort(vb + 1, vb + n + 1);
	fo(i,1,n) if(va[i] != vb[i]) return puts("NO"), void();

	if(n <= 5) return N5 :: solve();
	puts("YES");
}

int main()
{
	int T; cin >> T;
	while(T--) solve();
	
    return 0;
}