#include<bits/stdc++.h>
using namespace std;
const int inf=0x3f3f3f3f;
namespace mcmf
{
	const int MAXN=11111,MAXM=111111;
	const int S=11100,T=11101;
	struct edge
	{
		int v,f,w;
		edge *next,*rev;
	}*h[MAXN],pool[MAXM*2];
	int top;
	void addedge(int u,int v,int c,int w)
	{
//		cerr<<"addedge "<<u<<' '<<v<<' '<<c<<' '<<w<<endl;
		edge *tmp=&pool[top++];tmp->v=v;tmp->f=c;tmp->w=w;tmp->next=h[u];h[u]=tmp;
		edge *pmt=&pool[top++];pmt->v=u;pmt->f=0;pmt->w=-w;pmt->next=h[v];h[v]=pmt;
		tmp->rev=pmt;pmt->rev=tmp;
	}
	deque<int> q;
	int last[MAXN],inq[MAXN];
	long long dis[MAXN],maxf[MAXN];
	edge *laste[MAXN];
	long long totcost=0,totflow=0;
	bool spfa()
	{
		memset(dis,0x3f,sizeof(dis));
		memset(last,0,sizeof(last));
		memset(maxf,0,sizeof(maxf));
		memset(inq,0,sizeof(inq));
		while(not q.empty())q.pop_front();
		q.push_front(S);
		maxf[S]=0x3f3f3f3f3f3f3f3fll;
		inq[S]=1;
		dis[S]=0;
		while(not q.empty())
		{
			int u=q.front();q.pop_front();
			inq[u]=0;
			for(edge *tmp=h[u];tmp;tmp=tmp->next)
			{
				if(tmp->f and dis[tmp->v]>dis[u]+tmp->w)
				{
					dis[tmp->v]=dis[u]+tmp->w;
					last[tmp->v]=u;
					maxf[tmp->v]=min(maxf[u],(long long)tmp->f);
					laste[tmp->v]=tmp;
					if(not inq[tmp->v])
					{
						if(q.empty() or dis[q.front()]>dis[tmp->v])q.push_front(tmp->v);
						else q.push_back(tmp->v);
						inq[tmp->v]=1;
					}
				}
			}
		}
		if(dis[T]>=0x3f3f3f3f3f3f3f3fll)return false;
//		cerr<<"mincost "<<dis[T]<<endl;
		int u=T;
		while(last[u])
		{
			laste[u]->f--;
			laste[u]->rev->f++;
			u=last[u];
		}
		totcost+=dis[T];
		totflow++;
		return true;
	}
}
using mcmf::addedge;
void addedgeu(int u,int v,int c,int w)
{
	addedge(u,v,c,w);
	addedge(v,u,c,w);
}
using mcmf::S;
using mcmf::T;
using mcmf::spfa;
int main()
{
	ios_base::sync_with_stdio(false);
	int n,m;
	cin>>n>>m;
	vector<string> s(n+5);
	for(int i=1;i<=n;i++)
	{
		string t;
		cin>>t;
		s[i]=' '+t;
	}
	vector<int> dx={-1,0,1,0},dy={0,1,0,-1};
	int sx=0,sy=0,tx=0,ty=0,ux=0,uy=0,sp=0,tp=0,up=0;
	auto gao=[&](int x,int y)
	{
		if(x==1)return y;
		else if(y==m)return x+m;
		else if(x==n)return n+m+m-y;
		else if(y==1) return n+m+m+n-x;
		else return 0;
	};
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			if(s[i][j]=='S')
				sx=i,sy=j,sp=gao(i,j);
			else if(s[i][j]=='T')
				tx=i,ty=j,tp=gao(i,j);
			else if(s[i][j]=='U')
				ux=i,uy=j,up=gao(i,j);
		}
	}
	int flip=0;
	if(sp>tp)swap(sp,tp),swap(sx,tx),swap(sy,ty);
	if(sp<up and up<tp)
	{
		flip=1;
		swap(sx,sy);
		swap(tx,ty);
		swap(ux,uy);
		vector<string> tmps(m+5,string(n+5,' '));
		for(int i=1;i<=n;i++)
			for(int j=1;j<=m;j++)
				tmps[j][i]=s[i][j];
		s.swap(tmps);
		swap(n,m);
	}
	set<tuple<int,int,int,int>> ban;
	int nx=sx,ny=sy,nd;
	if(nx==1)nd=0;
	else if(ny==m)nd=1;
	else if(nx==n)nd=2;
	else nd=3;
	auto addban=[&](int x1,int y1,int x2,int y2)
	{
//		cerr<<"addban "<<x1<<' '<<y1<<' '<<x2<<' '<<y2<<endl;
		if(x1>x2)swap(x1,x2);
		if(y1>y2)swap(y1,y2);
		ban.emplace(x1,y1,x2,y2);
	};
	while(nx!=tx or ny!=ty)
	{
		//go!
		if(1<=nx+dx[nd] and nx+dx[nd]<=n and 1<=ny+dy[nd] and ny+dy[nd]<=m and s[nx+dx[nd]][ny+dy[nd]]!='#')
		{
			addban(nx,ny,nx+dx[nd],ny+dy[nd]);
			nx+=dx[nd];
			ny+=dy[nd];
			nd=(nd+3)%4;
		}
		else nd=(nd+1)%4;
	}
	auto hs=[&](int x,int y)
	{
		return x*(m+1)+y+1;
	};
	int D;
	cin>>D;
	for(int i=1;i<=D;i++)
	{
		int x,y;
		char dir;
		cin>>x>>y>>dir;
		if(flip)swap(x,y),dir='r'+'b'-dir;
		int td;
		if(dir=='r')td=1;
		else td=2;
		if(not ban.contains({x,y,x+dx[td],y+dy[td]}))
		{
			if(td==1)addedgeu(hs(x-1,y),hs(x,y),1,1);
			else addedgeu(hs(x,y-1),hs(x,y),1,1);
		}
	}
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
		{
			if(s[i][j]=='#')
			{
				addedgeu(hs(i-1,j-1),hs(i,j-1),inf,0);
				addedgeu(hs(i,j-1),hs(i,j),inf,0);
				addedgeu(hs(i-1,j-1),hs(i-1,j),inf,0);
				addedgeu(hs(i-1,j),hs(i,j),inf,0);
			}
		}
	nx=tx,ny=ty;
	if(nx==1)nd=0;
	else if(ny==m)nd=1;
	else if(nx==n)nd=2;
	else nd=3;
	vector<int> dx2={-1,-1,0,0},dy2={-1,0,0,-1};
	while(nx!=ux or ny!=uy)
	{
		if(1<=nx+dx[nd] and nx+dx[nd]<=n and 1<=ny+dy[nd] and ny+dy[nd]<=m)
		{
			addedge(S,hs(nx+dx2[nd],ny+dy2[nd]),inf,0);
			nx+=dx[nd];
			ny+=dy[nd];
			nd=(nd+3)%4;
		}
		else nd=(nd+1)%4;
	}
	while(nx!=sx or ny!=sy)
	{
		if(1<=nx+dx[nd] and nx+dx[nd]<=n and 1<=ny+dy[nd] and ny+dy[nd]<=m)
		{
			addedge(hs(nx+dx2[nd],ny+dy2[nd]),T,inf,0);
			nx+=dx[nd];
			ny+=dy[nd];
			nd=(nd+3)%4;
		}
		else nd=(nd+1)%4;
	}
	if(not spfa())
	{
		cout<<-1<<endl;
		return 0;
	}
	if(not spfa())
	{
		cout<<-1<<endl;
		return 0;
	}
	cout<<mcmf::totcost<<endl;
	return 0;
}