#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, string> PIS;
typedef pair<int, int> PII;

const int N = 1e5 + 5;

vector<PIS> p[N];
int st[N];

void solve() {
	int n;
	cin >> n;
	for (int i = 0; i < n - 1; i ++ ) {
		int x, y;
		string s;
		cin >> x >> y >> s;
		p[y].push_back({x, s});
	}
	queue<int> q;
	q.push(1);
	vector<PII> l, s, t;
	while (!q.empty()) {
		int ver = q.front();
		q.pop();
		for (auto x : p[ver]) {
			int u = x.first;
			st[u] = st[ver] + 1;
			//cout << x.second << '\n';
			if (x.second == "Chang") l.push_back({st[u], u});
			if (x.second ==  "Duan") s.push_back({st[u], u});
			if (x.second ==  "Tong") t.push_back({st[u], u}); 
			q.push(u);
		}
	}
	sort(l.begin(), l.end());
	sort(s.begin(), s.end());
	sort(t.begin(), t.end());
	int len1 = s.size();
	if (l.size() != len1) {
		cout << "NO" << '\n';
		return;
	}
	for (int i = 0; i < len1; i ++ ) {
		if (s[i].first >= l[i].first) {
			cout << "NO" << '\n';
			return;
		}
	}
	int len2 = t.size();
	for (int i = 0; i < len2; i += 2 ) {
		if (i + 1 >= len2 || t[i].first != t[i + 1].first) {
			cout << "NO" << '\n';
			return;
		}
	}
	cout << "YES" << '\n';
	for (int i = 0; i < len1; i ++ ) cout << s[i].second << ' ' << l[i].second << '\n';
	for (int i = 0; i < len2; i += 2 ) cout << t[i].second << ' ' << t[i + 1].second << '\n';
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);

	int t = 1;
	//cin >> t;
	while (t -- ) {
		solve();
	}
	return 0;
}