#include "bits/stdc++.h"
#define rep(i,a,n) for(auto i=a;i<=n;i++)
#define per(i,a,n) for(auto i=n;i>=a;i--)
#define pb push_back
#define mp make_pair
#define FI first
#define SE second
#define all(A) A.begin(),A.end()
#define sz(A) (int)A.size()
template<class T> inline bool chmax(T &a, T b) {if(a<b) {a=b; return 1;} return 0;}
template<class T> inline bool chmin(T &a, T b) {if(b<a) {a=b; return 1;} return 0;}
using namespace std;

string to_string(const string& s) {return '"' + s + '"';}
string to_string(const char* s) {return to_string((string) s);}
template<typename A, typename B> string to_string(pair<A, B> p) {return "(" + to_string(p.FI) + ", " + to_string(p.SE) + ")";}
template<typename A> string to_string(A v) 
{
    bool first = 1;
    string res = "{";
    for(const auto &x: v) 
    {
        if (!first) res += ", ";
        first = 0;
        res += to_string(x);
    }
    res += "}";
    return res;
}

void debug_out() {cerr << endl;} 
template<typename Head, typename... Tail> void debug_out(Head H, Tail... T) 
{
    cerr << " " << to_string(H);
    debug_out(T...);
}
#ifndef ONLINE_JUDGE
    #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
    #define debug(...) if(0) puts("No effect.")
#endif

using ll = long long;
//using LL = __int128;
using pii = pair<int,int>;
using vi = vector<int>;
using db = double;
using ldb = long double;

const int maxn = 300'000;
const int inf = 0x3f3f3f3f;
const int mod = 998244353;

void solve()
{
    int n; scanf("%d",&n);
    static int w[maxn+5],b[maxn+5];
    int W = 0, B = 0;
    rep(i,1,n) scanf("%d%d",&w[i],&b[i]), W += w[i], B += b[i];
    if(W+B!=n*2-2 || W&1) return puts("No"), void();
    
    using dat = array<int,3>;
    set<dat> s[2];
    set<pii> S;
    auto ins = [&](int now) {
        int deg = w[now]+b[now];
        if(w[now]) s[0].insert({w[now],deg,now});
        if(b[now]) s[1].insert({b[now],deg,now});
        if(deg) S.insert({deg,now});
    };
    auto del = [&](int now) {
        int deg = w[now]+b[now];
        if(w[now]) s[0].erase({w[now],deg,now});
        if(b[now]) s[1].erase({b[now],deg,now});
        if(deg) S.erase({deg,now});
    };

    rep(i,1,n) ins(i);
    struct node {int u,v; char c;};
    vector<node> ans;
    while(sz(S))
    {
        //debug(S);
        auto [deg,now] = *S.begin();
        if(w[now]+b[now]!=1) return puts("No"), void();

        int is_b = b[now]==1;
        del(now);
        auto [_,__,v] = *--s[is_b].end();
        del(v);
        is_b ? b[v]-- : w[v]--;
        ins(v);
        ans.pb(node{now,v,is_b ? 'B' : 'W'});
    }
    puts("Yes");
    for(auto [u,v,c]: ans) printf("%d %d %c\n",u,v,c);
}

int main()
{
    int cas; scanf("%d",&cas); while(cas--) solve();
    return 0;
}