#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long n, long long M) {
  if (n == 0)
    return 1;
  else if (n % 2 == 0)
    return power((x * x) % M, n / 2, M);
  else
    return (x * power((x * x) % M, (n - 1) / 2, M)) % M;
}
long long fact(long long n, long long M) {
  long long r = 1;
  for (long long i = 0; i < n; i++) {
    r = (r * (i + 1)) % M;
  }
  return r;
}
long long cons_freq(long long a[], long long n, long long p, long long q) {
  long long c = 0;
  for (long long i = p; i < n; i++) {
    if (a[i] == q)
      c++;
    else
      break;
  }
  return c;
}
long long binary_search(long long a[], long long low, long long high,
                        long long key) {
  while (low <= high) {
    long long mid = (low + high) / 2;
    if (a[mid] < key)
      low = mid + 1;
    else if (a[mid] > key)
      high = mid - 1;
    else
      return mid;
  }
  return -1;
}
bool check_perfect_square(long long n) {
  return (sqrt(n) - floor(sqrt(n)) == 0);
}
bool check_prime(long long n) {
  if (n < 2) return false;
  for (long long i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) return false;
  }
  return true;
}
bool check_pali(string s) {
  string str = s;
  reverse(str.begin(), str.end());
  return str == s;
}
void dfs(vector<long long> adj[], bool vis[], long long s) {
  vis[s] = true;
  for (long long i = 0; i < adj[s].size(); i++) {
    if (!vis[adj[s][i]]) dfs(adj, vis, adj[s][i]);
  }
}
void bfs(vector<long long> adj[], bool vis[], long long s) {
  queue<long long> q;
  q.push(s);
  vis[s] = true;
  while (!q.empty()) {
    long long v = q.front();
    q.pop();
    for (long long i = 0; i < adj[v].size(); i++) {
      if (!vis[adj[v][i]]) {
        vis[adj[v][i]] = true;
        q.push(adj[v][i]);
      }
    }
  }
}
void dijkstra(vector<pair<long long, long long> > adj[], long long src,
              bool vis[], long long dist[], long long n) {
  multiset<pair<long long, long long> > s;
  s.insert(make_pair(0, src));
  while (!s.empty()) {
    pair<long long, long long> p = *s.begin();
    s.erase(s.begin());
    long long d = p.first, v = p.second;
    if (vis[v]) continue;
    vis[v] = true;
    for (long long i = 0; i < adj[v].size(); i++) {
      if (dist[v] + adj[v][i].second < dist[adj[v][i].first]) {
        dist[adj[v][i].first] = dist[v] + adj[v][i].second;
        s.insert(make_pair(dist[adj[v][i].first], adj[v][i].first));
      }
    }
  }
}
bool comp(pair<long long, long long> a, pair<long long, long long> b) {
  if (a.first != b.first) return a.first < b.first;
  return a.second < b.second;
}
int main() {
  ;
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long t;
  cin >> t;
  while (t--) {
    long long n, x, y, a = 0, b = 0;
    string s;
    cin >> n;
    vector<pair<long long, long long> > v;
    for (long long i = 0; i < n; i++) {
      cin >> x >> y;
      v.push_back(make_pair(x, y));
    }
    sort(v.begin(), v.end(), comp);
    bool f = 0;
    for (long long i = 0; i < n; i++) {
      if (v[i].first < a) {
        f = 1;
        break;
      } else {
        long long x = v[i].first - a;
        while (x--) s.push_back('R');
        a = v[i].first;
      }
      if (v[i].second < b) {
        f = 1;
        break;
      } else {
        long long x = v[i].second - b;
        while (x--) s.push_back('U');
        b = v[i].second;
      }
    }
    if (f)
      cout << "NO\n";
    else {
      cout << "YES\n" << s << "\n";
    }
  }
  return 0;
}
