#include <bits/stdc++.h>

using namespace std;

#define mp make_pair
#define pb emplace_back
#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

using pii = pair <int, int>;

const int N = 1e6 + 10;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  return x * f;
}

int n, m, col[N], a[N], b[N];
vector <int> e[N], con[N];
char s[N], t[N];

int fa[N];
int get(int u) { return u == fa[u] ? u : fa[u] = get(fa[u]); }
void merge(int u, int v) { fa[get(v)] = get(u); }

void solve() {
  n = read(), m = read();
  rep(i, 1, n) col[i] = -1, e[i].clear(), fa[i] = i, con[i].clear();
  rep(i, 1, m) {
    int u = read(), v = read();
    e[u].pb(v), e[v].pb(u), merge(u, v);
  }
  rep(i, 1, n) a[i] = read();
  scanf("%s", s + 1);
  rep(i, 1, n) b[i] = read();
  scanf("%s", t + 1);
  rep(i, 1, n) con[get(i)].pb(i);
  rep(i, 1, n) if (get(i) == i) {
    col[i] = 0;
    function <bool(int)> dfs = [&](int u) {
      for (int v : e[u]) {
        if (~col[v]) {
          if (col[u] == col[v]) return false;
        }
        else {
          col[v] = !col[u];
          if (!dfs(v)) return false;
        }
      }
      return true;
    } ;
    if (dfs(i)) {
      multiset <pii> x, y;
      for (auto it : con[i]) {
        x.insert(mp(a[it], col[it] ^ (s[it] == 'B')));
        y.insert(mp(b[it], col[it] ^ (t[it] == 'B')));
      }
      if (x != y) return printf("NO\n"), void();
    }
    else {
      int cx = 0, cy = 0;
      multiset <int> x, y;
      for (auto it : con[i]) {
        cx += s[it] == 'R', cy += t[it] == 'R';
        x.insert(a[it]), y.insert(b[it]);
      }
      if ((cx & 1) != (cy & 1)) return printf("NO\n"), void();
      if (x != y) return printf("NO\n"), void();
    }
  }
  printf("YES\n");
}

int main() {
  for (int tc = read(); tc; -- tc) {
    solve();
  }
  return 0;
}