#include <bits/stdc++.h>

using i64 = long long;

void solve() {
    int n, m;
    std::cin >> n >> m;

    std::vector<std::vector<int>> adj(n);
    for (int i = 0; i < m; i ++ ) {
        int u, v;
        std::cin >> u >> v;
        u --, v -- ;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    std::vector<int> a(n), b(n);
    std::string c, d;
    for (int i = 0; i < n; i ++ ) {
        std::cin >> a[i];
    }
    std::cin >> c;
    for (int i = 0; i < n; i ++ ) {
        std::cin >> b[i];
    }
    std::cin >> d;

    bool bip;
    std::vector<int> vec;
    std::vector<int> col(n, -1);
    auto dfs = [&](auto self, int x, int c) -> void {
        col[x] = c;
        vec.push_back(x);
        for (auto y : adj[x]) {
            if (col[y] == -1) {
                self(self, y, c ^ 1);
            } else if (col[x] == col[y]) {
                bip = false;
            }
        }
    };

    for (int i = 0; i < n; i ++ ) {
        if (col[i] == -1) {
            vec.clear();
            bip = true;
            dfs(dfs, i, 0);
            if (bip) {
                std::vector<int> x[2], y[2];
                for (auto j : vec) {
                    x[col[j] ^ (c[j] == 'R')].push_back(a[j]);
                    y[col[j] ^ (d[j] == 'R')].push_back(b[j]);
                }
                std::sort(x[0].begin(), x[0].end());
                std::sort(x[1].begin(), x[1].end());
                std::sort(y[0].begin(), y[0].end());
                std::sort(y[1].begin(), y[1].end());
                if (x[0] != y[0] || x[1] != y[1]) {
                    std::cout << "NO\n";
                    return;
                }
            } else {
                int p = 0, q = 0;
                std::vector<int> x, y;
                for (auto j : vec) {
                    x.push_back(a[j]);
                    y.push_back(b[j]);
                    p += c[j] == 'R';
                    q += d[j] == 'R';
                }
                std::sort(x.begin(), x.end());
                std::sort(y.begin(), y.end());
                if (x != y || p % 2 != q % 2) {
                    std::cout << "NO\n";
                    return;
                }
            }
        }
    }
    std::cout << "YES\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;
    std::cin >> t;

    while (t -- ) {
        solve();
    }

    return 0;
}