#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define re read()
#define MOD 998244353
#define i128 __int128
#define pll pair<ll,ll>
#define pii pair<int,int>
#define ull unsigned long long
void solve()
{
	int n,m;
	int ans1=0,ans2=0;
	cin>>n>>m;
	getchar();
	vector<vector<int>>a(n+1,vector<int>(m+1,0));
	vector<vector<bool>>flag(n+1,vector<bool>(m+1,0));
	vector<vector<char>>s(n+1,vector<char>(m+1,0));
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			cin>>s[i][j];
		}
		getchar();
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			cin>>a[i][j];
		}
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			int x=i,y=j;
			while(!flag[x][y])
			{
				flag[x][y]=true;
				if(s[x][y]=='r')
				{
					int dy=y+a[x][y];
					if(dy<=m)
					{
						y=dy;
					}
					else
					{
						ans1++;
					}
				}
				else if(s[x][y]=='l')
				{
					int dy=y-a[x][y];
					if(dy>=1)
					{
						y=dy;
					}
					else
					{
						ans1++;
					}
				}
				else if(s[x][y]=='d')
				{
					int dx=x+a[x][y];
					if(dx<=n)
					{
						x=dx;
					}
					else
					{
						ans1++;
					}
				}
				else if(s[x][y]=='u')
				{
					int dx=x-a[x][y];
					if(dx<=1)
					{
						x=dx;
					}
					else
					{
						ans1++;
					}
				}
				if(x==i&&y==j)
					ans2++;
			}
		}
	}
	//cout<<ans1<<" "<<ans2<<endl;
	if(ans1+ans2==1)
		cout<<"Yes"<<endl;
	else
		cout<<"No"<<endl;
}
int main()
{
	ll T = 1;
	cin>>T;
	while (T--)
	{
		solve();
	}
}