#include <bits/stdc++.h>
using namespace std;

template <class T> int sz(T&& a) { return int(size(forward<T>(a))); }

template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;

using ll = int64_t;
using vi = vc<int>;

template <class F>
struct ycr {
	F f;
	
	template <class T>
	explicit ycr(T&& f_) : f(forward<T>(f_)) {}

	template <class... Args>
	decltype(auto) operator()(Args&&... args) {
		return f(ref(*this), forward<Args>(args)...);
	}
};
template <class F>
decltype(auto) yc(F&& f) {
	return ycr<decay_t<F>>(forward<F>(f));
}

const int N=1e5+5;
int n;
int p[N],fa[N],op[N];
struct node{
	int to,last;
}tree[N*2];
int ss=1,head[N];
inline void add(int from,int to)
{
	tree[++ss].to=to;
	tree[ss].last=head[from];
	head[from]=ss;
}

int re[N];
int len1=0, len2=0, len3=0;
int re1[N],re2[N],re3[N],deep[N];
bool pre[N],suf[N];

int ans[N];

inline bool cmp(int x,int y)
{
	return deep[x]<deep[y];
}

void match(int i, int j) {
	ans[i] = j;
	ans[j] = i;
}

void NO() {
	cout << "NO" << endl;
	exit(0);
}

inline void dfs(int from,int x)
{
	deep[x]=deep[from]+1;
	for(int i=head[x];i;i=tree[i].last)
	{
		int k=tree[i].to;
		dfs(x,k);
	}
	//cout<<x<<" "<<"yes"<<endl;
	len1=len2=len3=0;
	for(int i=head[x];i;i=tree[i].last)
	{
		int k=tree[i].to;
		if(re[k]==0) continue;
		else if(op[re[k]]==1) re1[++len1]=re[k];
		else if(op[re[k]]==2) re2[++len2]=re[k];
		else re3[++len3]=re[k];
	}
	if(op[x]==1) re1[++len1]=x;
	else if(op[x]==2) re2[++len2]=x;
	else if(op[x]==3) re3[++len3]=x; 
	sort(re1+1,re1+len1+1,cmp);
	sort(re2+1,re2+len2+1,cmp);
	sort(re3+1,re3+len3+1,cmp);
	vector<int> rem;
	//if(op[x]==0)
	//{
		// tong
		{
			vector<int> bads;
			for (int st = 1; st <= len2; ) {
				int en = st+1;
				while (en <= len2 && deep[re2[st]] == deep[re2[en]]) en++;
				if ((en - st) % 2 == 1) {
					bads.push_back(re2[st]);
					for (int i = st+1; i+1 < en; i += 2) {
						ans[re2[i]] = re2[i+1];
						ans[re2[i+1]] = re2[i];
					}
				} else {
					for (int i = st; i+1 < en; i += 2) {
						ans[re2[i]] = re2[i+1];
						ans[re2[i+1]] = re2[i];
					}
				}
				st = en;
			}
			if (bads.size() > 1) {
				cout<<"NO"<<endl;
				exit(0);
			}
			if (bads.size() == 1) {
				rem.push_back(bads[0]);
			}
		}

		// chang duan
		{

			if(abs(len1-len3)>1)
			{
				cout<<"NO"<<endl;
				exit(0);
			}
			if(len1==len3)
			{
				for(int i=1;i<=len1;i++)
					if(deep[re1[i]]>=deep[re3[i]])
					{
						cout<<"NO"<<endl;
						exit(0);
					}
					else
					{
						ans[re1[i]]=re3[i];
						ans[re3[i]]=re1[i];
					}
			}
			else if(len1==len3+1)
			{
				vector<int> z;
				int j = 1;
				for (int i = 1; i <= len3; i++) {
					while (j <= len1 && deep[re1[j]] < deep[re3[i]]) {
						z.push_back(re1[j]);
						j++;
					}
					if (z.empty()) {
						NO();
					}
					match(re3[i], z.back());
					z.pop_back();
				}
				while (j <= len1) z.push_back(re1[j++]);
				assert(z.size() == 1);
				rem.push_back(z[0]);
			}
			else
			{
				assert(len1 == len3-1);
				vector<int> z;
				int j = len3;
				for (int i = len1; i >= 1; i--) {
					while (j >= 1 && deep[re1[i]] < deep[re3[j]]) {
						z.push_back(re3[j]);
						j--;
					}
					if (z.empty()) {
						NO();
					}
					match(re1[i], z.back());
					z.pop_back();
				}
				while (j >= 1) z.push_back(re3[j--]);
				assert(z.size() == 1);
				rem.push_back(z[0]);
			}	
		}

		if (rem.size() > 1) {
			cout << "NO" << endl;
			exit(0);
		}
		if (rem.size() == 1) {
			re[x] = rem[0];
		} else {
			re[x] = 0;
		}
		//cerr << "x=" << x << ", re=" << re[x] << endl;
	//}
	// else if(op[x]==1)
	// {
	// 	if(len1 || len2 || len3>1)
	// 	{
	// 		cout<<"NO"<<endl;
	// 		exit(0);
	// 	}
	// 	if(len3==0) re[x]=x;
	// 	else ans[x]=re3[1], ans[re3[1]]=x;
	// }
	// else if(op[x]==2)
	// {
	// 	if(len1 || len3 || len2)
	// 	{
	// 		cout<<"NO"<<endl;
	// 		exit(0);
	// 	}
	// 	re[x]=x;
	// }
	// else if(op[x]==3)
	// {
	// 	if(len1 || len3 || len2)
	// 	{
	// 		cout<<"NO"<<endl;
	// 		exit(0);
	// 	}
	// 	re[x]=x;
	// }
}

int main() {
	ios_base::sync_with_stdio(false), cin.tie(nullptr);
	cout << fixed << setprecision(20);
	cin>>n; int id;
	string s;
	for(int i=2;i<=n;i++)
	{
		cin>>id>>fa[i]>>s;
		add(fa[i],i);
		if(s=="Duan") op[i]=1;
		else if(s=="Tong")  op[i]=2;
		else if(s=="Chang") op[i]=3;
	}
	dfs(0,1);
	if(re[1])
	{
		cout<<"NO"<<endl;
		exit(0);
	}
	cout<<"YES"<<endl;
	for(int i=1;i<=n;i++)
	{
		if(i>ans[i]) continue;
		cout<<i<<" "<<ans[i]<<endl;
	}
}