#include <bits/stdc++.h>

enum {
	NONE = 0,
	TONG,
	CHANG,
	DUAN,
};

void quit() {
	std::cout << "NO\n";
	exit(0);
}

struct label {
	int type, depth, id;	
};

int n;
std::vector<std::pair<int, int>> ans;
std::vector<std::vector<int>> ch;
std::vector<int> nt;

label dfs(int cur, int depth = 1) {
	// std::cerr << "cur = " << cur << char(10);
	std::vector<label> chang, duan, tong;
	auto push_back = [&](label l) {
		switch(l.type) {
			case CHANG: chang.push_back(l); break;
			case  DUAN:  duan.push_back(l); break;
			case  TONG:  tong.push_back(l); break;
		}
	};
	push_back({ nt[cur], depth, cur });
	for(auto ch: ch[cur]) push_back(dfs(ch, depth + 1));
	
	// std::cerr << "cc cur = " << cur << char(10);
	// std::cerr << "tong.size() = " << tong.size() << ", duan.size() == " << duan.size() << ", chang.size() == " << chang.size() << char(10);
	
	if(duan.size() > chang.size() + 1 || chang.size() > duan.size() + 1) quit();
	if(tong.size() % 2 == 1 && duan.size() != chang.size()) quit();
	if(tong.size() % 2 == 0) {
		// std::cerr << "debug1 cur = " << cur << " \n";
		for(int i = 0; i < tong.size(); i += 2) ans.emplace_back(tong[i].id, tong[i + 1].id);
		std::sort( duan.begin(), duan.end(), [](label a, label b) { return a.depth < b.depth; });
		std::sort(chang.begin(),chang.end(), [](label a, label b) { return a.depth < b.depth; });
		if(duan.size() == chang.size()) {
			for(int i = 0; i < duan.size(); ++i) {
				if(duan[i].depth >= chang[i].depth) quit();
				ans.emplace_back(duan[i].id, chang[i].id);
			}
			return { NONE, 0, 0 };	
		} else
		if(duan.size() < chang.size()) {
			label res = {NONE, 0, 0};
			for(int i = 0, j = 0; i < duan.size(); ++i) {
				while(duan[i].depth >= chang[j].depth) {
					if(res.type == NONE) res = chang[j++];
					else quit();
				}
				ans.emplace_back(duan[i].id, chang[j++].id);
			}
			if(res.type == NONE) res = chang.back();
			return res;
		} else {
			label res = {NONE, 0, 0};
			for(int i = chang.size() - 1, j = duan.size() - 1; ~i; --i) {
				while(duan[j].depth >= chang[i].depth) {
					if(res.type == NONE) res = duan[j--];
					else quit();
				}
				ans.emplace_back(duan[j--].id, chang[i].id);
			}
			if(res.type == NONE) res = duan.front();
			return res;
		}
	} else {
		// std::cerr << "debug2 cur = " << cur << " \n";
		for(int i = 0; i < duan.size() && i < chang.size(); ++i) {
			ans.emplace_back(duan[i].id, chang[i].id);
		}
		for(int i = 1; i < tong.size(); i += 2) ans.emplace_back(tong[i].id, tong[i + 1].id);
		return tong.front();
	}
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin >> n;
	ch.resize(n + 1), nt.resize(n + 1);
	for(int i = 2, _, p; i <= n; ++i) {
		std::string s;
		std::cin >> _ >> p >> s;
		if(s == "Tong")  nt[i] = TONG;  else
		if(s == "Chang") nt[i] = CHANG; else
		if(s == "Duan")  nt[i] = DUAN;  else
		                 nt[i] = NONE;
		ch[p].push_back(i);
	}
	if(dfs(1).type != NONE) quit();
	std::cout << "YES\n";
	for(auto [a, b]: ans) std::cout << a << ' ' << b << char(10);
	return 0;
}

/*
8
2 1 -
3 1 -
4 2 Tong
5 2 Tong
6 3 Duan
7 3 -
8 7 Chang

10
2 1 Duan
3 2 Duan
4 2 -
5 4 Chang
6 2 Chang
7 1 Duan
8 6 Tong
9 6 Tong
10 3 Chang
*/