#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define pb push_back
#define x first
#define y second 
#define endl '\n'
#define list sajioaw
const LL maxn = 4e05+7;
const LL N=1e05+10;
const LL mod=1e09+7;
typedef pair<int,int>pl;
priority_queue<LL , vector<LL>, greater<LL> >t;
priority_queue<LL> q;
LL gcd(LL a, LL b){
	return b > 0 ? gcd(b , a % b) : a;
}

LL lcm(LL a , LL b){
	return a / gcd(a , b) * b;
}
int n , m;
int a[N];
void init(int n){
	for(int i = 0 ; i <= n ; i ++){
		a[i] = 0;
	}
}
vector<int>list[3];
vector<int>tr[N];
int depth[N];
void dfs(){
	queue<int>q;
	q.push(1);
	depth[1] = 1;
	while(!q.empty()){
		int x = q.front();
		q.pop();
		for(auto it : tr[x]){
			depth[it] = depth[x] + 1;
			q.push(it);
		}
	}
}
int cmp(int a , int b){
	return depth[a] < depth[b];
}
int cmp2(int a , int b){
	return depth[a] > depth[b];
}
void solve() 
{
	cin >> n;
	for(int i = 0 ;i < n ; i ++){
		int ch , fa ;
		string s;
		cin >> ch >> fa >> s;
		tr[fa].pb(ch);
		if(s == "Tong"){
			list[0].pb(ch);
		}
		else if(s == "Duan"){
			list[1].pb(ch);
		}
		else if(s == "Chang"){
			list[2].pb(ch);
		}
	}
	dfs();
	vector<pair<int , int > > v;
	sort(list[0].begin() , list[0].end() , cmp);
	if(list[0].size() % 2 == 1){
		cout<<"NO\n";
		return;
	}
	else{
		for(int i = 0 ; i < list[0].size() ; i += 2){
			int x = list[0][i] , y = list[0][i + 1];
			if(depth[x] == depth[y]){
				v.pb({x , y});
			}
			else{
				cout<<"NO\n";
				return;
			}
		}
	}
	sort(list[1].begin() , list[1].end() , cmp);
	sort(list[2].begin() , list[2].end() , cmp);
	if(list[1].size() != list[2].size()){
		cout<<"NO\n";
		return;
	}
	else{
		for(int i = 0 ; i < list[1].size() ; i ++){
			int x = list[1][i] , y = list[2][i];
			if(depth[x] < depth[y]){
				v.pb({x , y});				
			}
			else{
				cout<<"NO\n";
				return;				
			}
		}
	}
	cout<<"YES\n";
	for(auto it : v){
		cout<<it.x<<" "<<it.y<<endl;
	}
}            
int main() 
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout.precision(10);
    int t=1;
//	cin>>t;
    while(t--)
    {
    	solve();
    }
    return 0;
}