#include "bits/stdc++.h"
#define int long long
#define rep(i,a,b) for (int i=(a); i < (b); ++i)
#define rin(i,a,b) rep(i,a,b+1)
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
#define all(x) begin(x), end(x)
#define pb push_back
 
void solve() {
    int n, m; cin >> n >> m;
    int i, j, tx, ty; cin >> i >> j >> tx >> ty;
    string s; cin >> s;
 
    int steps = 0;
 
    auto C = [&](int dx, int dy) {
        return (dx == 1)*2 + (dy == 1);
    };
    int dx = s[0] == 'D' ? 1 : -1;
    int dy = s[1] == 'R' ? 1 : -1;
 
 
 
 
    vector vis(n+1, vector(m+1, array<char, 4>()));
    while (pair(i, j) != pair(tx, ty)) {
        auto &pos = vis[i][j][C(dx, dy)];
        if (pos) return void(cout << "-1\n");
        pos = true;
 
        bool move = true;
        if (i+dx > n || i+dx < 1) { dx *= -1; move = false; }
        if (j+dy > m || j+dy < 1) {dy *= -1; move = false; }
        if (!move) steps++;
        i += dx, j += dy;
    }
    cout << steps << '\n';
}
 
signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int t; cin >> t;
    while (t--)
    solve();
    return 0;
}