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

#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...)
#endif

// D, R, U, L
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};

bool solve() {
    ll x1, y1, x2, y2;
    char d1, d2;
    cin >> x1 >> y1 >> d1 >> x2 >> y2 >> d2;
    int k1 = string("RULD").find(d1), k2 = string("RULD").find(d2);
    if (x1 == x2) {
        if (dx[k2] - dx[k1] != 0 || dy[k2] - dy[k1] == 0) return false;
        // y1 + dy[k1] * t = y2 + dy[k2] * t なる t が存在するか
        ll t = 2 * (y1 - y2) / (dy[k2] - dy[k1]);
        debug(x1, x2, t);
        return t > 0;
    } else if (y1 == y2) {
        if (dy[k2] - dy[k1] != 0 || dx[k2] - dx[k1] == 0) return false;
        // x1 + dx[k1] * t = x2 + dx[k2] * t なる t が存在するか
        ll t = 2 * (x1 - x2) / (dx[k2] - dx[k1]);
        debug(y1, y2, t);
        return t > 0;
    } else {
        // x1 + dx[k1] * t = x2 + dx[k2] * t
        // y1 + dy[k1] * t = y2 + dy[k2] * t なる t が存在するか
        if (dx[k2] - dx[k1] == 0 || dy[k2] - dy[k1] == 0) return false;
        if ((x1 - x2) * (dy[k2] - dy[k1]) != (y1 - y2) * (dx[k2] - dx[k1])) return false;
        ll t = 2 * (x1 - x2) / (dx[k2] - dx[k1]);
        debug(t);
        return t > 0;
    }
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    int T;
    cin >> T;
    while (T--) {
        cout << (solve() ? "Yes" : "No") << "\n";
    }
}