#include <bits/stdc++.h>
using namespace std;
#define rep(i, d, u) for(int i = d; i <= u; ++i)
#define dep(i, u, d) for(int i = u; i >= d; --i)
#define cep(n) while(n--)
#define gep(i, a) for(int i = firs[a]; i; i = neig[i])
int ured() {
	int re = 0;
	char ch;
	do {
		ch = getchar();
	} while('9' < ch || ch < '0');
	do {
		re = re * 10 + (ch ^ '0');
	} while('0' <= (ch = getchar()) && ch <= '9');
	return re;
}
char cred() {
	char ch;
	do {
		ch = getchar();
	} while(('Z' < ch || ch < 'A') && ch != '-');
	return ch;
}
void uwit(int da) {
	int ch[21], cn = 0;
	do {
		ch[++cn] = da - da / 10 * 10;
	} while(da /= 10);
	do {
		putchar('0' ^ ch[cn]);
	} while(--cn);
}
const int _maxn = 100011;
int n, a, b, firs[_maxn], neig[_maxn << 1], arri[_maxn << 1], s[_maxn], dpoa[_maxn], dpob[_maxn], dept[_maxn], rans[_maxn];
char c;
bool pdif, dpod[_maxn];
void dfs1(int at, int fa) {
	dept[at] = dept[fa] + 1;
	set<int> st;
	map<int, int> po;
	if(s[at] == 1) {
		st . insert(dept[at]), po[dept[at]] = at;
	}
	gep(i, at) {
		if(arri[i] != fa) {
			dfs1(arri[i], at);
			if(dpoa[arri[i]]) {
				if(st . count(dept[dpoa[arri[i]]])) {
					rans[po[dept[dpoa[arri[i]]]]] = dpoa[arri[i]], rans[dpoa[arri[i]]] = po[dept[dpoa[arri[i]]]], st . erase(dept[dpoa[arri[i]]]);
				} else {
					st . insert(dept[dpoa[arri[i]]]), po[dept[dpoa[arri[i]]]] = dpoa[arri[i]];
				}
			}
		}
	}
	if(st . size() > 1) {
		pdif = 1;
	} else if(st . size()) {
		dpoa[at] = po[*st . begin()];
	}
}
struct node {
	int da, at;
	node() {}
	node(int fi, int se) : da(fi), at(se) {}
};
bool operator<(node le, node ri) {
	return le . da == ri . da ? le . at < ri . at : le . da < ri . da;
}
std :: set<node> sets;
std :: set<node> :: iterator regi;
void dfs2(int at, int fa) {
	vector<int> sa, sb;
	if(s[at] == 2) {
		sa . push_back(at);
	} else if(s[at] == 3) {
		sb . push_back(at);
	}
	gep(i, at) {
		if(arri[i] != fa) {
			dfs2(arri[i], at);
			if(s[dpob[arri[i]]] == 2) {
				sa . push_back(dpob[arri[i]]);
			} else if(s[dpob[arri[i]]] == 3) {
				sb . push_back(dpob[arri[i]]);
			}
		}
	}
	if(sa . size() == sb . size() + 1) {
		sets . clear();
		for(int i : sb) {
			sets . insert(node(dept[i], i));
		}
		sort(sa . begin(), sa . end(), [](int le, int ri) {
			return dept[le] > dept[ri];
		});
		for(int i : sa) {
			if((regi = sets . upper_bound(node(dept[i], n))) == sets . end()) {
				if(dpob[at]) {
					pdif = 1;
					break;
				} else {
					dpob[at] = i;
				}
			} else {
				rans[i] = regi -> at, rans[regi -> at] = i, sets . erase(regi);
			}
		}
	} else if(sa . size() + 1 == sb . size()) {
		sets . clear();
		for(int i : sa) {
			sets . insert(node(dept[i], i));
		}
		sort(sb . begin(), sb . end(), [](int le, int ri) {
			return dept[le] < dept[ri];
		});
		for(int i : sb) {
			if((regi = sets . lower_bound(node(dept[i], 1))) == sets . begin()) {
				if(dpob[at]) {
					pdif = 1;
					break;
				} else {
					dpob[at] = i;
				}
			} else {
				rans[i] = prev(regi) -> at, rans[prev(regi) -> at] = i, sets . erase(prev(regi));
			}
		}
	} else if(sa . size() == sb . size()) {
		if(sa . size()) {
			sort(sa . begin(), sa . end(), [](int le, int ri) {
				return dept[le] < dept[ri];
			}), sort(sb . begin(), sb . end(), [](int le, int ri) {
				return dept[le] < dept[ri];
			});
			rep(i, 0, sa . size() - 1) {
				if(dept[sa[i]] < dept[sb[i]]) {
					rans[sa[i]] = sb[i], rans[sb[i]] = sa[i];
				} else {
					pdif = 1;
					return;
				}
			}
		}
	} else {
		pdif = 1;
	}
}
int main() {
	n = ured();
	rep(i, 1, n - 1) {
		a = ured(), b = ured(), neig[i << 1] = firs[a], firs[a] = i << 1, arri[i << 1] = b;
		neig[i << 1 | 1] = firs[b], firs[b] = i << 1 | 1, arri[i << 1 | 1] = a;
		if((c = cred()) == 'T') {
			s[a] = 1;
		} else if(c == 'D') {
			s[a] = 2;
		} else if(c == 'C') {
			s[a] = 3;
		}
	}
	dfs1(1, 0);
	if(pdif || dpoa[1]) {
		puts("NO");
		return 0;
	}
	dfs2(1, 0);
	if(pdif) {
		puts("NO");
		return 0;
	}
	puts("YES");
	rep(i, 1, n) {
		if(rans[i] && rans[i] < i) {
			uwit(rans[i]), putchar(' '), uwit(i), putchar('\n');
		}
	}
	return 0;
}