#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
const int N = 1e5 + 5;
#define int long long
typedef pair<int, int> PII;
#define MAX LONG_LONG_MAX
string mp[N];
int st[N], ar[N], f[N];
int n, m, ans;

int dfs(int x, int y, int deep)
{
    if (deep == ans)
        return 1;
    if (st[(x - 1) * n + y])
        return 0;
    f[(x - 1) * n + y] = 1;
    st[(x - 1) * n + y] = 1;
    int xx = x, yy = y;
    if (mp[x][y] == 'r')
        yy += ar[(x - 1) * n + y];
    else if (mp[x][y] == 'd')
        xx += ar[(x - 1) * n + y];
    else if (mp[x][y] == 'l')
        yy -= ar[(x - 1) * n + y];
    else
        xx -= ar[(x - 1) * n + y];

    if (xx < 0 || xx > n || yy < 0 || yy > m)
        return 0;
    if (dfs(xx, yy, deep + 1))
        return 1;
    st[(x - 1) * n + y] = 0;
    return 0;
}

void solve()
{
    cin >> n >> m;
    ans = n * m;
    for (int i = 1; i <= n; i++)
    {
        cin >> mp[i];
        mp[i] = " " + mp[i];
    }
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            int x;
            cin >> x;
            ar[(i - 1) * n + j] = x;
            f[(i - 1) * n + j] = 0;
            st[(i - 1) * n + j] = 0;
        }
    }

    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
        {
            if (f[(i - 1) * n + j])
                continue;
            if (dfs(i, j, 1))
            {
                cout << "Yes" << endl;
                return;
            }
        }

    cout << "No" << endl;
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int tcase;
    cin >> tcase;
    while (tcase--)
        solve();
    return 0;
}