#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<set>
#include<ctime>
#include<assert.h>
#define _INT_INF ((int)0x3f3f3f3f)
#define _UINT_MAX ((unsigned int)0xffffffff)
#define _INT_MAX ((int)0x7fffffff)
#define _LL_INF ((long long)0x3f3f3f3f3f3f3f3f)
#define _ULL_MAX ((unsigned long long)0xffffffffffffffff)
#define _LL_MAX ((long long)0x7fffffffffffffff)
namespace FastIO{
	#define inline __attribute__((always_inline)) inline
#ifdef LOCAL
	#define getChar getchar()
#else
	#define BUF_SIZE 33554432
	char __buff__[BUF_SIZE];char *__p1__=__buff__,*__p2__=__buff__;
	#define getChar (__p1__==__p2__&&(__p2__=(__p1__=__buff__)+fread(__buff__,1,BUF_SIZE,stdin),__p1__==__p2__)?EOF:*__p1__++)
#endif
	inline int read(){
		register int x=0;register char c=getChar;
		while(c<'0'||c>'9')	c=getChar;while(c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getChar;return x;
	}
	inline int reads(){
		register int x=0,y=1;register char c=getChar;
		while(c<'0'||c>'9') y&=(c!='-'),c=getChar;while(c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getChar;return y?x:-x;
	}
	inline long long readl(){
		register long long x=0;register char c=getChar;
		while(c<'0'||c>'9') c=getChar;while(c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getChar;return x;
	}
	inline int readsl(){
		register long long x=0;register int y=1;register char c=getChar;
		while(c<'0'||c>'9') y&=(c!='-'),c=getChar;while(c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getChar;return y?x:-x;
	}
	inline void read(char *s){
		register char c=getChar;while(c=='\n'||c=='\r'||c==' '||c=='\t') c=getChar;
        while(c!='\n'&&c!='\r'&&c!=' '&&c!='\t'&&c!=EOF) *s=c,s++,c=getChar;*s=0;
	}
	#undef getChar
	#define EN write('\n')
	#define SPACE write(' ')
#ifdef LOCAL
	#define RET 0
	inline void write(register int x){printf("%d",x);}
	inline void writeEN(register int x){printf("%d\n",x);}
	inline void writeSP(register int x){printf("%d ",x);}
	inline void write(register long long x){printf("%lld",x);}
	inline void writeEN(register long long x){printf("%lld\n",x);}
	inline void writeSP(register long long x){printf("%lld ",x);}
	inline void write(register char c){printf("%c",c);}
	inline void write(const char *c){printf("%s",c);}
#else
	#undef BUF_SIZE
	#define RET fwrite(__buffW__,1,__bb__,stdout),0
	#define BUFW_SIZE 33554432
	char __buffW__[BUFW_SIZE];int __bb__;
	char __stack__[28];
	inline void write(register int x,register short base=10){
		if(!x) return __buffW__[__bb__++]='0',void();if(x<0) __buffW__[__bb__++]='-',x=-x;
		register short top=0;
		while(x) __stack__[++top]=(x%base)^48,x/=base;while(top) __buffW__[__bb__++]=__stack__[top--];
	}
	inline void writeEN(register int x,register short base=10){
		if(!x) return __buffW__[__bb__++]='0',__buffW__[__bb__++]='\n',void();if(x<0) __buffW__[__bb__++]='-',x=-x;
		register short top=0;
		while(x) __stack__[++top]=(x%base)^48,x/=base;while(top) __buffW__[__bb__++]=__stack__[top--];__buffW__[__bb__++]='\n';
	}
	inline void writeSP(register int x,register short base=10){
		if(!x) return __buffW__[__bb__++]='0',__buffW__[__bb__++]=' ',void();if(x<0) __buffW__[__bb__++]='-',x=-x;
		register short top=0;
		while(x) __stack__[++top]=(x%base)^48,x/=base;while(top) __buffW__[__bb__++]=__stack__[top--];__buffW__[__bb__++]=' ';
	}
	inline void write(register long long x,register short base=10){
		if(!x) return __buffW__[__bb__++]='0',void();if(x<0) __buffW__[__bb__++]='-',x=-x;
		register short top=0;
		while(x) __stack__[++top]=(x%base)^48,x/=base;while(top) __buffW__[__bb__++]=__stack__[top--];
	}
	inline void writeEN(register long long x,register short base=10){
		if(!x) return __buffW__[__bb__++]='0',__buffW__[__bb__++]='\n',void();if(x<0) __buffW__[__bb__++]='-',x=-x;
		register short top=0;
		while(x) __stack__[++top]=(x%base)^48,x/=base;while(top) __buffW__[__bb__++]=__stack__[top--];__buffW__[__bb__++]='\n';
	}
	inline void writeSP(register long long x,register short base=10){
		if(!x) return __buffW__[__bb__++]='0',__buffW__[__bb__++]=' ',void();if(x<0) __buffW__[__bb__++]='-',x=-x;
		register short top=0;
		while(x) __stack__[++top]=(x%base)^48,x/=base;while(top) __buffW__[__bb__++]=__stack__[top--];__buffW__[__bb__++]=' ';
	}
	inline void write(register char c){__buffW__[__bb__++]=c;}
	inline void write(const char *c){while(*c) __buffW__[__bb__++]=*c,c++;}
	#undef BUFW_SIZE
#endif
#undef inline
}//namespace FastIO
using namespace FastIO;
namespace lib{
#define inline __attribute__((always_inline)) inline
	inline void chkMin(int &a,const int &b){(a>b)&&(a=b);}
	inline void chkMin(long long &a,const long long &b){(a>b)&&(a=b);}
	inline void chkMax(int &a,const int &b){(a<b)&&(a=b);}
	inline void chkMax(long long &a,const long long &b){(a<b)&&(a=b);}
	inline int min(const int &a,const int &b){return a>b?b:a;}
	inline long long min(const long long &a,const long long &b){return a>b?b:a;}
	inline int max(const int &a,const int &b){return a>b?a:b;}
	inline long long max(const long long &a,const long long &b){return a>b?a:b;}
	inline void swap(int &a,int &b){a^=b;b^=a;a^=b;}
	inline void swap(long long &a,long long &b){a^=b;b^=a;a^=b;}
	inline int abs(const int &a){return a>0?a:-a;}
	inline long long abs(const long long &a){return a>0?a:-a;}
#undef inline
}
#define N 300006
struct Node{
	int u,deg;
	__attribute__((always_inline))inline int operator < (const Node &o){return deg==o.deg?u<o.u:deg<o.deg;}
	__attribute__((always_inline))inline int operator == (const Node &o){return u==o.u&&deg==o.deg;}
};
__attribute__((always_inline))inline void swap(Node &a,Node &b){lib::swap(a.u,b.u);lib::swap(a.deg,b.deg);}
struct Heap{
	Node a[N*30];
	int size;
	inline void push(const Node &x){
		int i=++size,fa;a[size]=x;
		while(i>1){
			fa=i>>1;
			if(a[fa]<a[i]) return;
			swap(a[fa],a[i]);i=fa;
		}
	}
	inline void pop(){
		int i=1,ls,rs;a[1]=a[size--];
		while((i<<1)<=size){
			ls=i<<1;rs=ls|1;
			if(rs<=size&&a[rs]<a[ls]) ls=rs;
			if(a[i]<a[ls]) return;
			swap(a[ls],a[i]);i=ls;
		}
	}
};
struct DeletableHeap{
	Heap ins,dele;
//		int debug;
	inline Node top(){
		while(dele.size&&ins.a[1]==dele.a[1]) ins.pop(),dele.pop();
		return ins.a[1];
	}
	inline void pop(){
		while(dele.size&&ins.a[1]==dele.a[1]) ins.pop(),dele.pop();
//			assert(ins.size);
//			if(debug) printf("	pop : %d %d size= %d\n",ins.a[1].u,ins.a[1].deg,size());
		ins.pop();
	}
	__attribute__((always_inline))inline void push(const Node &x){
//			if(debug) printf("ins : %d %d size= %d\n",x.u,x.deg,size());
		ins.push(x);
	}
	__attribute__((always_inline))inline void del(const Node &x){
//			if(debug) printf("del : %d %d size= %d\n",x.u,x.deg,size());
		dele.push(x);
	}
	__attribute__((always_inline))inline void clear(){ins.size=dele.size=0;}
	__attribute__((always_inline))inline int size(){return ins.size-dele.size;}
	__attribute__((always_inline))inline int empty(){return ins.size==dele.size;}
};
int n;
int w[N],b[N];
DeletableHeap que,queW,queB;
int u[N],v[N];
char col[N];
int tot;
inline void add(int a,int b,char ch){u[++tot]=a;v[tot]=b;col[tot]=ch;}
inline void output(){
	write("Yes\n");
	for(int i=1;i<n;i++) writeSP(u[i]),writeSP(v[i]),write(col[i]),EN;
}
#define FAIL {write("No\n");goto OVER;}
int main(){
//		printf("%lld\n",3*sizeof que);
int $=read();while($--){
	n=read();tot=0;
	int W=0,B=0;
	for(int i=1;i<=n;i++) w[i]=read(),b[i]=read(),W+=w[i],B+=b[i];
	if((W&1)||(B&1)) FAIL;
	if(W+B!=n+n-2) FAIL;
	if(n==1){
		if(w[1]||b[1]) FAIL;
		write("Yes\n");continue;
	}
	for(int i=1;i<=n;i++)if(w[i]+b[i]>=n||!(w[i]+b[i])) FAIL;
	que.clear();queW.clear();queB.clear();
//		queW.debug=1;
	for(int i=1;i<=n;i++){
		que.push((Node){i,w[i]+b[i]});
		if(w[i]+b[i]>1&&w[i]) queW.push((Node){i,-w[i]});
		if(w[i]+b[i]>1&&b[i]) queB.push((Node){i,-b[i]});
	}
	while(que.size()>2){
		int u=que.top().u,v;que.pop();
		if(w[u]+b[u]>1) FAIL;
		if(w[u]){
			if(queW.empty()) FAIL;
			v=queW.top().u;queW.pop();
			que.del((Node){v,w[v]+b[v]});
			if(w[v]+b[v]>1&&b[v]) queB.del((Node){v,-b[v]});
			w[v]--;
			que.push((Node){v,w[v]+b[v]});
			if(w[v]+b[v]>1&&w[v]) queW.push((Node){v,-w[v]});
			if(w[v]+b[v]>1&&b[v]) queB.push((Node){v,-b[v]});
			add(u,v,'W');
		}
		else if(b[u]){
			if(queB.empty()) FAIL;
			v=queB.top().u;queB.pop();
			que.del((Node){v,w[v]+b[v]});
			if(w[v]+b[v]>1&&w[v]) queW.del((Node){v,-w[v]});
			b[v]--;
			que.push((Node){v,w[v]+b[v]});
			if(w[v]+b[v]>1&&b[v]) queB.push((Node){v,-b[v]});
			if(w[v]+b[v]>1&&w[v]) queW.push((Node){v,-w[v]});
			add(u,v,'B');
		}
	}
	W=que.top().u;que.pop();
	B=que.top().u;
	if(w[W]!=w[B]||b[W]!=b[B]) FAIL;
	add(W,B,w[W]?'W':'B');
	output();
OVER:;
}
	return RET;
}