#include <bits/stdc++.h>
 
using namespace std;

long long calc(const vector<long long> &s, const vector<int> &v, int x) {
    long long p = (int)(upper_bound(v.begin(), v.end(), x) - v.begin() );
    p--;
    long long ans = 0;
    ans += (long long)(p + 1) * 1 * x - s[p + 1];
    ans += s[v.size()] - s[p + 1] - (long long)(v.size() - p - 1) * x;
    return ans;
}
 
void solve() {
	cin>>n>>m;
    vector<int> x(n);
    vector<int> y(n);
    for (int i = 0; i < n; ++i) {
		cin>>x[i]>>y[i];
    }
    sort(x.begin(), x.end() );
    sort(y.begin(), y.end() );
    vector<long long> sx(n + 5, 0), sy(n + 5, 0);
    for (int i = 0; i < n; i++) {
        sx[i + 1] = sx[i] + x[i];
        sy[i + 1] = sy[i] + y[i];
    }
	string s;
	cin>>s; 
    int curx = 0, cury = 0;
    for (int i = 0; i < m; ++i) {
        if (s[i] == 'L') {
            curx--;
        }
        if (s[i] == 'R') {
            curx++;
        }
        if (s[i] == 'U') {
            cury++;
        }
        if (s[i] == 'D') {
            cury--;
        }
 
        long long ans = 0;
        ans = calc(sx, x, curx) + calc(sy, y, cury);
        cout<<ans<<"\n";
    }
}
 
int main() {
    int test;
    cin>>test;
    while (test--) {
        solve();
    }
    return 0;
}