/**
 * @author TrueFalse
 * @date 2024.9.20
 * @version 1.2
 */

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

using ci = const int;

using u32 = uint32_t;
using i64 =  int64_t;
using u64 = uint64_t;

template<class T> inline void Max(T &x, const T &y) { if (x < y) x = y; }
template<class T> inline void Min(T &x, const T &y) { if (y < x) x = y; }

const int N = 5e5 + 5;

struct Map {
	vector<int> e[N];
	void addedge(int u, int v) {
		e[u].push_back(v);
	}
	void clear(ci n) {
		for (int i = 1; i <= n; ++i)
			e[i].clear();
	}
	vector<int> &operator[](ci &x) { return e[x]; }
} E;

struct LSH {
	multiset<int> mp;
	void clear() { mp.clear(); }
	void ins(ci &x) { mp.insert(x); }
	bool operator!=(const LSH &o) const { return mp != o.mp; }
} H[2];

int T, n, m, a[2][N];
char str[2][N];
int tong[N];
int c[2][4];

bool dfs(int u, bool f) {
	if (~tong[u]) return tong[u] == f;
	tong[u] = f;
	for (int k = 0; k < 2; ++k) {
		++c[k][f ^ (str[k][u] == 'R')];
		++c[k][2 + (str[k][u] == 'R')];
		H[k].ins(a[k][u]);
	}
	bool fl(1);
	for (ci &v : E[u]) fl &= dfs(v, !f);
	return fl;
}

bool work() {
	scanf("%d %d", &n, &m);
	memset(tong, -1, sizeof(int) * (n + 1));
	E.clear(n);
	for (int i = 1, u, v; i <= m; ++i) {
		scanf("%d %d", &u, &v);
		E.addedge(u, v);
		E.addedge(v, u);
	}
	for (int k = 0; k < 2; ++k) {
		for (int i = 1; i <= n; ++i)
			scanf("%d", &a[k][i]);
		scanf("%s", str[k] + 1);
	}

	for (int i = 1; i <= n; ++i) {
		if (!~tong[i]) {
			H[0].clear(), H[1].clear();
			memset(c, 0, sizeof c);
			if (dfs(i, 0)) {
				if (c[0][0] != c[1][0] or c[0][1] != c[1][1]) return 0;
			} else {
				if ((abs(c[0][2] - c[1][2]) ^ abs(c[0][3] - c[1][3])) & 1) return 0;
			}
			if (H[0] != H[1]) return 0;
		}
	}
	return 1;
}

int main() {
#ifndef ONLINE_JUDGE
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
#endif

	scanf("%d", &T);
	while (T--) {
		puts(work() ? "YES" : "NO");
	}

	return 0;
}