#include <bits/stdc++.h>

using namespace std;

using ll = long long;

#define all(v) v.begin(), v.end()

void solve() {
    int n;
    cin >> n;

    vector<vector<int>> g(n);
    vector<int> dep(n), col(n, -1);
    vector<string> t = {"Tong", "Chang", "Duan"};
    for (int i = 0; i < n - 1; i++) {
        int u, v;
        string s;
        cin >> u >> v >> s;
        u--, v--;

        g[v].push_back(u);
        dep[u] = dep[v] + 1;
        for (int j = 0; j < 3; j++) {
            if (s == t[j]) {
                col[u] = j;
            }
        }
    }

    vector<int> recol(n, -1), redep(n), repos(n);
    vector<pair<int, int>> ans;
    auto dfs = [&](auto self, int u) -> void {
        multiset<pair<int, int>> a, b;
        map<int, vector<int>> c;
        if (col[u] == 0) {
            recol[u] = 0;
            repos[u] = u;
            redep[u] = dep[u];
        } else if (col[u] == 1) {
            a.emplace(dep[u], u);
        } else if (col[u] == 2) {
            b.emplace(dep[u], u);
        }
        for (auto v : g[u]) {
            self(self, v);
            if (recol[v] == 0) {
                c[redep[v]].push_back(repos[v]);
            } else if (recol[v] == 1) {
                a.emplace(redep[v], repos[v]);
            } else if (recol[v] == 2) {
                b.emplace(redep[v], repos[v]);
            }
        }

        for (auto i = a.begin(); i != a.end(); i = a.erase(i)) {
            if (b.empty()) {
                break;
            }
            auto it = b.lower_bound(pair((*i).first, 0));
            if (it == b.begin()) {
                if (recol[u] == -1) {
                    recol[u] = 1;
                    repos[u] = (*i).second;
                    redep[u] = (*i).first;
                } else {
                    cout << "NO\n";
                    exit(0);
                }
            } else {
                it = prev(it);
                ans.emplace_back((*it).second, (*i).second);
                b.erase(it);
            }
        }

        for (auto [dep, ma] : c) {
            if (int(ma.size()) & 1) {
                if (recol[u] == -1) {
                    recol[u] = 0;
                    redep[u] = dep;
                    repos[u] = ma[0];
                    for (int j = 1; j < int(ma.size()); j += 2) {
                        ans.emplace_back(ma[j], ma[j + 1]);
                    }
                } else {
                    cout << "NO\n";
                    exit(0);
                }
            } else {
                for (int j = 0; j < int(ma.size()); j += 2) {
                    ans.emplace_back(ma[j], ma[j + 1]);
                }
            }
        }

        if (a.size() > 1 || b.size() > 1) {
            cout << "NO\n";
            exit(0);
        } else if (a.size() == 1) {
            if (recol[u] != -1) {
                cout << "NO\n";
                exit(0);
            } else {
                auto [x, y] = *a.begin();
                redep[u] = x;
                repos[u] = y;
                recol[u] = 1;
            }
        } else if (b.size() == 1) {
            if (recol[u] != -1) {
                cout << "NO\n";
                exit(0);
            } else {
                auto [x, y] = *b.begin();
                redep[u] = x;
                repos[u] = y;
                recol[u] = 2;
            }
        }
    };
    dfs(dfs, 0);

    if (recol[0] != -1) {
        cout << "NO\n";
    } else {
        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;
}