#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
//#include <utility>
//#include <memory>
//#include <functional>
//#include <deque>
//#include <cctype>
//#include <ctime>
//#include <numeric>
//#include <list>
//#include <iomanip>

//#if __cplusplus >= 201103L
//#include <array>
//#include <tuple>
//#include <initializer_list>
//#include <forward_list>
//
//#define cauto const auto&
//#else

//#endif

using namespace std;


typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()
#define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x) 
#define debug(x) 
#endif
#define LDcout(x,n) fixed<<setprecision(n)<<x

#define MOD 1000000007LL
#define EPS 1e-8
static const int INF=1<<24;
int h,w;
pair<pii,int> foo1(vector<string> &v){
	string vec=">v<^";
	rep(i,v.size()){
		rep(j,v[i].size()){
			rep(k,4){
				if(v[i][j]==vec[k]){
					v[i][j]='.';
					return mkp(pii(i,j),k);
				}
			}
		}
	}
	return mkp(pii(-1,-1),-1);
}
bool check(int a,int b){
	if(0<=a&&a<h&&0<=b&&b<w) return true;
	return false;
}
void mainmain(){
	int n;
	cin>>n;
	rep(o,n){
		if(o) cout<<endl;
		cin>>h>>w;
		vector<string> v(h);
		rep(i,h) cin>>v[i];
		string s;
		int t;
		cin>>t>>s;
		int dd[]={0,1,0,-1,0};// >,v,<,^
		pair<pii,int> pos=foo1(v);
		string DRUL="RDLU";
		//SRSSRRUSSR
		rep(i,s.size()){
			// cout<<pos.F.F<<" "<<pos.F.S<<" "<<pos.S<<endl;
			// rep(j,h) cout<<v[j]<<endl;
			// cout<<endl;
			if(s[i]=='S'){
				int y=pos.F.F;
				int x=pos.F.S;
				y+=dd[pos.S];
				x+=dd[pos.S+1];
				while(check(y,x)){
					if(v[y][x]=='#') break;
					if(v[y][x]=='*'){
						v[y][x]='.';
						break;
					}
					y+=dd[pos.S];
					x+=dd[pos.S+1];
				}
			}
			else{
				rep(j,4){
					if("RDLU"[j]==s[i]){
						pos.S=j;
					}
				}
				int ny=pos.F.F+dd[pos.S];
				int nx=pos.F.S+dd[pos.S+1];
				if(check(ny,nx)&&v[ny][nx]=='.'){
					pos.F=pii(ny,nx);
				}
			}
		}
		v[pos.F.F][pos.F.S]=">v<^"[pos.S];
		rep(i,h){
			cout<<v[i]<<endl;
		}
	}
}


signed main() {
	ios_base::sync_with_stdio(false);
  	cout<<fixed<<setprecision(0);
    mainmain();
}

Measured memory_bytes: 1212