#include<bits/stdc++.h>
#define pii pair<int,int>
#define pb emplace_back
using namespace std;
const int N=1000005;
struct edge{
	int v,nxt;
}e[N*2];
int d[N],n,head[N],cnt,a[N],flag=1;char ch[10];
vector<pii> ans;
void adde(int u,int v)
{e[++cnt].v=v;e[cnt].nxt=head[u];head[u]=cnt;}
int dp[N],c[N][4];
void dfs(int u,int fa)
{
	vector<int> v1,v2,v3;
	d[u]=d[fa]+1;++c[u][a[u]];
	if(a[u]==1)v1.push_back(u);
	if(a[u]==2)v2.push_back(u);
	if(a[u]==3)v3.push_back(u);
	for(int i=head[u];i;i=e[i].nxt)
	{
		int v=e[i].v;dfs(v,u);
		if(a[dp[v]]==1)v1.push_back(dp[v]);
		if(a[dp[v]]==2)v2.push_back(dp[v]);
		if(a[dp[v]]==3)v3.push_back(dp[v]);
		for(int j=0;j<4;++j)c[u][j]+=c[v][j];
	}	
	if(!flag)return;
	if(abs(c[u][1]-c[u][2])>=2){flag=0;return;}
	if(c[u][1]!=c[u][2]&&(c[u][3]&1)){flag=0;return;}
	sort(v1.begin(),v1.end(),[&](const int u,const int v){return d[u]<d[v];});
	sort(v2.begin(),v2.end(),[&](const int u,const int v){return d[u]<d[v];});
	sort(v3.begin(),v3.end(),[&](const int u,const int v){return d[u]<d[v];});
	for(int i=0;i<v3.size();i+=2)
	{
		if(i==v3.size()-1){dp[u]=v3[i];break;}
		if(d[v3[i]]!=d[v3[i+1]])dp[u]=v3[i],++i;
		ans.pb(v3[i],v3[i+1]);
	}
	if(c[u][1]>c[u][2])
	{
		int l=v1.size()-1,r=v2.size()-1;
		while(l>=0||r>=0)
		{
			if(l>=0&&r>=0&&d[v1[l]]<d[v2[r]])
			{ans.pb(v1[l],v2[r]);--l;--r;}
			else if(!dp[u]&&l>=0)dp[u]=v1[l],--l;
			else {flag=0;return;}
		}
	}
	else
	{
		int l=0,r=0;
		while(l<v1.size()||r<v2.size())
		{
			if(l<v1.size()&&r<v2.size()&&d[v1[l]]<d[v2[r]])
			{ans.pb(v1[l],v2[r]);++l;++r;}
			else if(!dp[u]&&r<v2.size())dp[u]=v2[r],++r;
			else {flag=0;return;}
		}
	}
}
int main()
{
	scanf("%d",&n);
	for(int i=1,u,v;i<n;++i)
	{
		scanf("%d%d%s",&u,&v,ch);adde(v,u);
		if(ch[0]=='D')a[u]=1;
		if(ch[0]=='C')a[u]=2;
		if(ch[0]=='T')a[u]=3;
		if(ch[0]=='-')a[u]=0;
	}
	dfs(1,0);if(dp[1])flag=0;
	if(!flag)puts("NO");
	else 
	{
		puts("YES");
		for(auto p:ans)printf("%d %d\n",p.first,p.second);
	}
	return 0;
}