#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
#define debug(x) cout << #x << ": " << x << el
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 3e5 + 10, INF = 0x3f3f3f3f, mod = 998244353;

void inc(ll &a, ll b) {
    a += b;
    if (a >= mod) a -= mod;
}

void dec(ll &a, ll b) {
    a -= b;
    if (a < 0) a += mod;
}

ll add(ll a, ll b) {
    a += b;
    return a >= mod ? a - mod : a;
}

ll del(ll a, ll b) {
    a -= b;
    return a < 0 ? a + mod : a;
}

vector<int> G[N];
vector<int> chang, duan, tong;
int dep[N];

void dfs(int u, int fa) {
    dep[u] = dep[fa] + 1;
    for (int v: G[u]) dfs(v, u);
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int n; cin >> n;
    for (int i = 1; i < n; ++i) {
        int a, b; string str; cin >> a >> b >> str;
        if (str == "Chang") chang.emplace_back(a);
        else if (str == "Duan") duan.emplace_back(a);
        else if (str == "Tong") tong.emplace_back(a);
        G[b].emplace_back(a);
    }
    dfs(1, 0);
    vector<pii> sc, sd, st;
    for (auto a: chang) sc.emplace_back(dep[a], a);
    for (auto a: duan) sd.emplace_back(dep[a], a);
    for (auto a: tong) st.emplace_back(dep[a], a);
    vector<pii> ans;
    if (st.size() & 1) return cout << "NO\n", 0;
    if (sc.size() != sd.size()) return cout << "NO\n", 0;
    sort(st.begin(), st.end()), sort(sc.begin(), sc.end()), sort(sd.begin(), sd.end());
    for (int i = 0; i < st.size(); i += 2) {
        if (st[i].x != st[i + 1].x) return cout << "NO\n", 0;
        ans.emplace_back(st[i].y, st[i + 1].y);
    }
    for (int i = 0; i < sc.size(); ++i) {
        if (sc[i].x <= sd[i].x) return cout << "NO\n", 0;
        ans.emplace_back(sc[i].y, sd[i].y);
    }
    cout << "YES\n";
    for (auto[a, b]: ans) cout << a << ' ' << b << el;
}