/* Problem URL: https://codeforces.com/problemset/problem/1807/F */

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

const int oo = INT32_MAX >> 1;
const ll OO = INT64_MAX >> 1;


void pre()
{

}

#define TEST 1

void solve()
{
    int n, m, i1, j1, i2, j2;
    string d;
    cin >> n >> m >> i1 >> j1 >> i2 >> j2 >> d;
    i1--, j1--, i2--, j2--;

    int mask = ((d[0] == 'D') << 1) | (d[1] == 'R');

    vvvi dis(n, vvi(m, vi(4, oo)));
    dis[i1][j1][mask] = 0;

    queue<tuple<int, int, int>> q;
    q.emplace(i1, j1, mask);

    while (!q.empty()) {
        auto [i, j, cur] = q.front();
        q.pop();

        int bounce = 0;

        int prev = dis[i][j][cur];

        if (cur & 2) {
            i++;
        } else {
            i--;
        }

        if (cur & 1) {
            j++;
        } else {
            j--;
        }

        if (i < 0) {
            i = 1;
            cur ^= 2;
            bounce |= 1;
        }

        if (i >= n) {
            i = n - 2;
            cur ^= 2;
            bounce |= 1;
        }

        if (j < 0) {
            j = 1;
            cur ^= 1;
            bounce |= 1;
        }

        if (j >= m) {
            j = m - 2;
            cur ^= 1;
            bounce |= 1;
        }

        if (dis[i][j][cur] > prev + bounce) {
            dis[i][j][cur] = prev + bounce;
            q.emplace(i, j, cur);
        }
    }

    int ans = *min_element(all(dis[i2][j2]));
    cout << (ans == oo ? -1 : ans) << '\n';
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    pre();

    int t;
    (TEST && cin >> t) || (t = 1);
    while (t--) {
        solve();
    }
}