#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;
typedef tuple<int, int, int> tiii;
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;
}

int p[N];
vector<int> G[N];
vector<int> chang, duan, tong;
int dep[N];
vector<pii> ans;
tiii f[N];

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

void dfs0(int u) {
    dep[u] = dep[p[u]] + 1;
    for (int v: G[u]) dfs0(v);
}

void dfs1(int u) {
    vector<tiii> t;
    set<tiii> c, d;
    if (get<1>(f[u])) {
        if (get<1>(f[u]) == 1) c.insert(f[u]);
        else if (get<1>(f[u]) == 2) d.insert(f[u]);
        else if (get<1>(f[u]) == 3) t.push_back(f[u]);
    }
    for (int v: G[u]) {
        dfs1(v);
        int x = get<1>(f[v]);
        if (x) {
            if (x == 1) c.insert(f[v]);
            else if (x == 2) d.insert(f[v]);
            else t.push_back(f[v]);
        }
    }
    sort(t.begin(), t.end());
    while (t.size() >= 2) {
        if (get<0>(t.back()) == get<0>(t[t.size() - 2])) {
            ans.emplace_back(get<2>(t.back()), get<2>(t[t.size() - 2]));
            t.pop_back(), t.pop_back();
        } else quit();
    }
    if (abs((int)c.size() - (int)d.size()) >= 2) quit;
    if (c.size() <= d.size()) {
        while (c.size()) {
            auto[x, y, z] = *c.begin();
            auto it = d.lower_bound({x, 0, 0});
            if (it == d.begin()) quit();
            --it;
            ans.emplace_back(z, get<2>(*it));
            c.erase(c.begin()), d.erase(it);
        }
    } else {
        while (d.size()) {
            auto[x, y, z] = *d.begin();
            auto it = c.lower_bound({x, 0, 0});
            if (it == c.end()) quit();
            ans.emplace_back(z, get<2>(*it));
            d.erase(d.begin()), c.erase(it);
        }
    }
    if (c.size() + d.size() + t.size() >= 2) quit();
    if (c.size()) f[u] = *c.begin();
    else if (d.size()) f[u] = *d.begin();
    else if (t.size()) f[u] = *t.begin();
    else f[u] = {0, 0, 0};
}

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);
        p[a] = b;
    }
    dfs0(1);
    for (int i: chang) f[i] = {dep[i], 1, i};
    for (int i: duan) f[i] = {dep[i], 2, i};
    for (int i: tong) f[i] = {dep[i], 3, i};
    dfs1(1);
    if (get<0>(f[1])) quit();
    cout << "YES\n";
    for (auto[a, b]: ans) cout << a << ' ' << b << el;
}