#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
using mint = modint998244353;
using ll = long long;
using lb = long double;
using VI = vector<int>;
using VL = vector<ll>;
using P = pair<int, int>;
inline void scan(){}
template<class Head,class... Tail>
inline void scan(Head&head,Tail&... tail){std::cin>>head;scan(tail...);}
#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)
#define LB(...) lb __VA_ARGS__;scan(__VA_ARGS__)
#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)
template<class ll> inline bool chmax(ll& a, ll b) { if (a < b) { a = b; return 1; } return 0; }template<class ll> inline bool chmin(ll& a, ll b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T>
std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}
template<typename T>
std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?" ":"");}return os;}
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a)  (a).rbegin(),(a).rend()
const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
//_
struct car
{
  int x, y;
  char d;
};
int main(){
  INT(t);
  rep(i, 0, t){
    vector<car> c(2);
    for(auto&&[x, y, d] : c){
      cin >> x >> y >> d;
    }
    bool ok = false;
    if(c[0].d == c[1].d){
      cout << "No" << endl;
      continue;
    }
    if(c[0].d > c[1].d){
      swap(c[0], c[1]);
    }
    if(c[0].d == 'D'){
      if(c[1].d == 'U'){
        if(c[0].x == c[1].x && c[0].y > c[1].y){
          ok = true;
        }
      }
      if(c[1].d == 'R'){
        if(c[0].y - c[1].y == c[0].x - c[1].x && c[0].x - c[1].x > 0){
          ok = true;
        }
      }
      if(c[1].d == 'L'){
        if(c[0].y - c[1].y == c[1].x - c[0].x && c[1].x - c[0].x > 0){
          ok = true;
        }
      }
    }
    if(c[0].d == 'L'){
      if(c[1].d == 'U'){
        if(c[0].y - c[1].y == c[0].x - c[1].x && c[0].x - c[1].x > 0){
          ok = true;
        }
      }
      if(c[1].d == 'R'){
        if(c[0].y == c[1].y && c[0].x > c[1].x){
          ok = true;
        }
      }
    }
    if(c[0].d == 'R'){
      if(c[1].d == 'U'){
        if(c[0].y - c[1].y == c[1].x - c[0].x && c[1].x - c[0].x > 0){
          ok = true;
        }
      }
    }
    if(ok){
      cout << "Yes" << endl;
    }else{
      cout << "No" << endl;
    }
  }
}