#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<ctime>
#include<random>
#include<assert.h>
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define dbg(x) cerr<<"In Line "<< __LINE__<<" the "<<#x<<" = "<<x<<'\n';
#define dpi(x,y) cerr<<"In Line "<<__LINE__<<" the "<<#x<<" = "<<x<<" ; "<<"the "<<#y<<" = "<<y<<'\n';
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
typedef pair<int,int>pii;
typedef pair<ll,int>pli;
typedef pair<ll,ll>pll;
typedef pair<int,ll>pil;
typedef vector<int>vi;
typedef vector<ll>vll;
typedef vector<pii>vpii;
typedef vector<pil>vpil;
template<typename T>T cmax(T &x, T y){return x=x>y?x:y;}
template<typename T>T cmin(T &x, T y){return x=x<y?x:y;}
template<typename T>
T &read(T &r){
	r=0;bool w=0;char ch=getchar();
	while(ch<'0'||ch>'9')w=ch=='-'?1:0,ch=getchar();
	while(ch>='0'&&ch<='9')r=r*10+(ch^48),ch=getchar();
	return r=w?-r:r;
}
template<typename T1,typename... T2>
void read(T1 &x,T2& ...y){read(x);read(y...);}
const int mod=998244353;
inline void cadd(int &x,int y){x=(x+y>=mod)?(x+y-mod):(x+y);}
inline void cdel(int &x,int y){x=(x-y<0)?(x-y+mod):(x-y);}
inline int add(int x,int y){return (x+y>=mod)?(x+y-mod):(x+y);}
inline int del(int x,int y){return (x-y<0)?(x-y+mod):(x-y);}
int qpow(int x,int y){
	int s=1;
	while(y){
		if(y&1)s=1ll*s*x%mod;
		x=1ll*x*x%mod;
		y>>=1;
	}
	return s;
}
const int N=100010;
const int inf=0x7fffffff;
int n,fa[N];
vi eg[N];
int a[N],dep[N];
//0 Tong
//1 Duan
//-1 Chang
//inf -
int f[N];
vpii ans;
#define Lose do{puts("NO");exit(0);}while(0)
void dfs(int x){
	vi v0,vec;if(a[x]!=inf){
		if(a[x]==0)v0.pb(x);
		else vec.pb(x);
	}
	for(auto v:eg[x]){
		dfs(v);
		if(f[v]){
			if(a[f[v]]==0)v0.pb(f[v]);
			else vec.pb(f[v]);
		}
	}
	sort(v0.begin(),v0.end(),[&](const int &x,const int &y){return dep[x]<dep[y];});
	int len=v0.size();
	for(int i=0;i<len;i++){
		if(i==len-1 || dep[v0[i]]!=dep[v0[i+1]]){
			if(f[x])Lose;
			f[x]=v0[i];
		}
		else{
			ans.pb(mp(v0[i],v0[i+1]));
			++i;
		}
	}
	len=vec.size();
	sort(vec.begin(),vec.end(),[&](const int &x,const int &y){return dep[x]==dep[y]?a[x]<a[y]:dep[x]<dep[y];});
	int cf=0,cz=0;
	for(auto i:vec)if(a[i]==1)cz++;else cf++;
	if(abs(cf-cz)>1)Lose;
	if(abs(cf-cz)==1 && f[x])Lose;
	int s=0;
	if(abs(cf-cz)==0){
		for(auto i:vec){
			s+=a[i];
			if(s<0)Lose;
		}
	}
	else if(cf>cz){
		for(auto i:vec){
			s+=a[i];
			if(s<0){
				if(f[x])Lose;
				f[x]=i;
				++s;
			}
		}
	}
	else{
		reverse(vec.begin(),vec.end());
		for(auto i:vec){
			s-=a[i];
			if(s<0){
				if(f[x])Lose;
				f[x]=i;
				++s;
			}
		}
		reverse(vec.begin(),vec.end());
	}
	vi st;
	for(auto i:vec){
		if(i==f[x])continue;
		if(a[i]==-1){
			ans.pb(mp(st.back(),i));
			st.pop_back();
		}
		else st.pb(i);
	}
}
signed main(){
	#ifdef do_while_true
//		assert(freopen("data.in","r",stdin));
//		assert(freopen("data.out","w",stdout));
	#endif
	read(n);
	a[1]=inf;
	for(int i=2;i<=n;i++){
		read(i);read(fa[i]);
		eg[fa[i]].pb(i);
		char ch=getchar();
		while(ch!='-'&&ch!='T'&&ch!='D'&&ch!='C')ch=getchar();
		dep[i]=dep[fa[i]]+1;	
		if(ch=='-')a[i]=inf;
		else if(ch=='T')a[i]=0;
		else if(ch=='D')a[i]=1;
		else a[i]=-1;
	}
	dfs(1);
	if(f[1])puts("NO");
	else{
		puts("YES");
		for(auto i:ans)cout << i.fi << ' ' << i.se << '\n';
	}
    #ifdef do_while_true
		cerr<<'\n'<<"Time:"<<1.0*clock()/CLOCKS_PER_SEC*1000<<" ms"<<'\n';
	#endif
	return 0;
}