#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define endl '\n'
using ll = long long;
using ull = unsigned long long;
using PII = pair<int, int>;
using PLL = pair<ll, ll>;
const int N = 1e6 + 10;
const int M = 131;
const int INF = 0x3f3f3f3f;
const long long LNF = 0x3f3f3f3f3f3f3f3f;
const long long mod = 1e9 + 7;

void solve(){
	int n; cin >> n;
	vector<int> val(n + 1);
	vector<vector<int>> g(n + 1);
	for(int i = 1; i < n; i++){
		int a, b; cin >> a >> b;
		g[b].push_back(a);
		string s; cin >> s;
		if(s == "-") continue;
		if(s == "Tong") val[a] = 3;
		else if(s == "Duan") val[a] = 1;
		else val[a] = 2;
	}
	int flag = 1;
	vector<PII> res;
	vector<int> dep(n + 1);
	
	function <void(int)> dfs1 = [&] (int u){
		for(int v : g[u]){
			dep[v] = dep[u] + 1;
			dfs1(v);
		}	
	};
	
	function <int(int)> dfs2 = [&] (int u) -> int{
		vector<int> aa, bb, cc;
		for(int v : g[u]){
			int num = dfs2(v);
			if(!flag) return 0;
			if(val[num] == 0) continue;
			if(val[num] == 1) aa.push_back(num);
			if(val[num] == 2) bb.push_back(num);
			if(val[num] == 3) cc.push_back(num);
		}
		if(val[u] == 1) aa.push_back(u);
		if(val[u] == 2) bb.push_back(u);
		if(val[u] == 3) cc.push_back(u);
		sort(aa.begin(), aa.end(), [&] (int a, int b){
			return dep[a] < dep[b];
			});
		sort(bb.begin(), bb.end(), [&] (int a, int b){
			return dep[a] < dep[b];
			});
		sort(cc.begin(), cc.end(), [&] (int a, int b){
			return dep[a] < dep[b];
			});
		vector<int> num;
		int k = 0, z = cc.size();
		for(;k < z - 1; k += 2){
			if(dep[cc[k]] == dep[cc[k + 1]]){
				res.push_back({cc[k], cc[k + 1]});
				continue;
			}
			num.push_back(cc[k]);
			k--;
		}
		while(k < cc.size()) num.push_back(cc[k]), k++;
		
		if(aa.size() > bb.size()){
			int i = 0, j = 0;
			for(; i < aa.size() && j < bb.size();){
				if(dep[aa[i]] > dep[bb[j]]){
					num.push_back(aa[i]);
					i++;
				}
				else res.push_back({aa[i], bb[j]}), i++, j++;
			}
			while(i < aa.size()) num.push_back(aa[i]), i++;
			while(j < bb.size()) num.push_back(bb[i]), j++;
		}
		else{
			int i = 0, j = 0;
			for(; i < aa.size() && j < bb.size();){
				if(dep[aa[i]] > dep[bb[j]]){
					num.push_back(aa[i]);
					j++;
				}
				else res.push_back({aa[i], bb[j]}), i++, j++;
			}
			while(i < aa.size()) num.push_back(aa[i]), i++;
			while(j < bb.size()) num.push_back(bb[i]), j++;
		}
		if(num.size() >= 2){
			flag = 0;
			return 0;
		}
		return (num.size() ? num[0] : 0);
	};
	
	dep[1] = 1;
	dfs1(1);
	int num = dfs2(1);
	if(num != 0) flag = 0;
	if(!flag) cout << "NO" << endl;
	else{
		cout << "YES" << endl;
		for(auto [id1, id2] : res) cout << id1 << ' ' << id2 << endl;
	}
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(12);
	int t = 1;
	//cin >> t;
	while(t--){
		solve();
	}
	return 0 - 0;
}