#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

void solve() {
    int n;
    cin >> n;
    vector<int> a(n, -1);
    vector g(n, vector<int>());
    for (int i = 1; i < n; ++i) {
        int u, v;
        string s;
        cin >> u >> v >> s;
        --u, --v;
        g[v].push_back(u);
        if (s == "Tong") {
            a[u] = 0;
        } else if (s == "Duan") {
            a[u] = 1;
        } else if (s == "Chang") {
            a[u] = 2; 
        }
    }

    bool ok = true;
    vector<int> dep(n);
    vector<array<int, 2>> ans;

    auto dfs = [&] (auto dfs, int u) -> array<int, 2> {
        if (!ok) {
            cout << "NO1" << '\n'; exit(0);
            return {-1, -1};
        }
        vector f(3, vector<int>());
        if (a[u] != -1) {
            f[a[u]].push_back(u);
        }
        for (auto &v : g[u]) {
            dep[v] = dep[u] + 1;
            auto [x, y] = dfs(dfs, v);
            if (!ok) {
            cout << "NO2" << '\n'; exit(0);

                return {-1, -1};
            }
            if (x == -1) {
               continue; 
            }
            f[x].push_back(y);
        }
        bool have = false;
        sort(f[0].begin(), f[0].end(), [&] (auto &x, auto &y) {
            return dep[x] < dep[y];
        });
        array<int, 2> res{-1, -1};
        for (int i = 0; i < f[0].size(); ++i) {
            if (i + 1 >= f[0].size()) {
                if (!have) {
                    have = true;
                    res = {0, f[0][i]};
                } else {
            cout << "NO3" << '\n'; exit(0);
                    ok = false;
                    return {-1, -1};
                }
            } else {
                if (dep[f[0][i]] == dep[f[0][i + 1]]) {
                    ans.push_back({f[0][i], f[0][i + 1]});
                    ++i;
                } else {
                    if (!have) {
                        have = true;
                        res = {0, f[0][i]};
                    } else {
            cout << "NO4" << '\n'; exit(0);
                        ok = false;
                        return {-1, -1};
                    }
                }
            }
        }

        if (abs((int)f[1].size() - (int)f[2].size()) >= 2) {
            cout << "NO5" << '\n'; exit(0);
            ok = false;
            return {-1, -1};
        }

        if (f[1].size() >= f[2].size()) {
            sort(f[1].begin(), f[1].end(), [&] (auto &x, auto &y) {
                return dep[x] > dep[y];
            });
            sort(f[2].begin(), f[2].end(), [&] (auto &x, auto &y) {
                return dep[x] > dep[y];
            });
        } else {
            sort(f[1].begin(), f[1].end(), [&] (auto &x, auto &y) {
                return dep[x] < dep[y];
            });
            sort(f[2].begin(), f[2].end(), [&] (auto &x, auto &y) {
                return dep[x] < dep[y];
            });
        }

        int l = 0, r = 0;
        while (l < f[1].size() && r < f[2].size()) {
            int x = f[1][l], y = f[2][r];
            if (dep[x] < dep[y]) {
                ans.push_back({x, y});
            } else {
                if (!have) {
                    have = true;
                    if (f[1].size() > f[2].size()) {
                        res = {1, x};
                        --r;
                    } else if (f[1].size() < f[2].size()) {
                        res = {2, y};
                        --l;
                    } else {
            cout << "NO6" << '\n'; exit(0);
                        ok = false;
                        return {-1, -1};
                    }
                } else {
            cout << "NO7" << '\n'; exit(0);
                    ok = false;
                    return {-1, -1};
                }
            }
            ++l, ++r;
        }
        if (!have) {
            if (f[1].size() > f[2].size()) {
                res = {1, f[1][l]};
            } else if (f[1].size() < f[2].size()) {
                res = {2, f[2][r]};
            }
        } else if (f[1].size() != f[2].size()) {
            ok = false;
            return {-1, -1};
        }
        
        return res;
    };

    auto [x, y] = dfs(dfs, 0);
    
    if (x != -1 || !ok) {
        cout << "NO" << '\n';
        return;
    }
    
    cout << "YES" << '\n';
    
    for (auto &[u, v] : ans) {
        cout << u + 1 << ' ' << v + 1 << '\n';
    }
}

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

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