#include<bits/stdc++.h>

using namespace std;

int const maxn = 1e5 + 5;
int a[maxn], h[maxn];
vector < int > g[maxn];
vector < pair < int, int > > dp[maxn];
vector < pair < int, int > > ans;

int good(vector < pair < int, int > > A, vector < pair < int, int > > B) {
    assert(A.size() == B.size());
    for (int i = 0; i < A.size(); i++) {
        if (A[i].first <= B[i].first) return 0;
    }
    return 1;
}

void dfs(int v) {
    for (auto u : g[v]) {
        h[u] = h[v] + 1;
        dfs(u);
        for (auto key : dp[u]) dp[v].push_back(key);
    }
    if (a[v]) dp[v].push_back({a[v], v});
    vector < int > tong;
    for (auto key : dp[v]) {
        if (key.first == 2) tong.push_back(key.second);
    }
    sort(tong.begin(), tong.end(), [](int x, int y) {
        return h[x] < h[y];
    });
    vector < pair < int, int > > add;
    int i = 0;
    while (i < tong.size()) {
        if (i + 1 < (int)tong.size() && h[tong[i]] == h[tong[i + 1]]) {
            ans.push_back({tong[i], tong[i + 1]});
            i += 2;
        } else {
            add.push_back({2, tong[i]});
            i++;
        }
    }
    vector < pair < int, int > > big, small;
    for (auto key : dp[v]) {
        if (key.first == 1) big.push_back({h[key.second], key.second});
        else if (key.first == 3) small.push_back({h[key.second], key.second});
    }
    sort(big.begin(), big.end());
    sort(small.begin(), small.end());
    if (abs((int)big.size() - (int)small.size()) > 1) {
        cout << "NO\n";
        exit(0);
    }
    if (big.size() == small.size()) {
        for (int i = 0; i < big.size(); i++) {
            if (big[i].first <= small[i].first) {
                cout << "NO\n";
                exit(0);
            }
            ans.push_back({big[i].second, small[i].second});
        }
        dp[v] = {};
    } else if (big.size() > small.size()) {
        int lef = -1, righ = big.size();
        while (righ - lef > 1) {
            int mid = (righ + lef) / 2;
            vector < pair < int, int > > A, B = small;
            for (int i = 0; i < big.size(); i++) if (i != mid) A.push_back(big[i]);
            if (good(A, B)) lef = mid;
            else righ = mid;
        }
        if (lef == -1) {
            cout << "NO\n";
            exit(0);
        }
        dp[v] = {{1, big[lef].second}};
        vector < pair < int, int > > A, B = small;
        for (int i = 0; i < big.size(); i++) if (i != lef) A.push_back(big[i]);
        for (int i = 0; i < A.size(); i++) ans.push_back({A[i].second, B[i].second});
    } else {
        int lef = -1, righ = small.size();
        while (righ - lef > 1) {
            int mid = (righ + lef) / 2;
            vector < pair < int, int > > A = big, B;
            for (int i = 0; i < small.size(); i++) if (i != mid) B.push_back(small[i]);
            if (good(A, B)) righ = mid;
            else lef = mid;
        }
        if (righ == small.size()) {
            cout << "NO\n";
            exit(0);
        }
        dp[v] = {{3, small[righ].second}};
        vector < pair < int, int > > A = big, B;
        for (int i = 0; i < small.size(); i++) if (i != lef) B.push_back(small[i]);
        for (int i = 0; i < A.size(); i++) ans.push_back({A[i].second, B[i].second});
    }
    for (auto key : add) dp[v].push_back(key);
    if (dp[v].size() > 1) {
        cout << "NO\n";
        exit(0);
    }
}

main() {
#ifdef HOME
    freopen("input.txt", "r", stdin);
#endif // HOME
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, u, v;
    cin >> n;
    string type;
    for (int i = 2; i <= n; i++) {
        cin >> u >> v >> type;
        assert(u == i);
        g[v].push_back(u);
        if (type == "Chang") a[i] = 1;
        else if (type == "Tong") a[i] = 2;
        else if (type == "Duan") a[i] = 3;
    }
    dfs(1);
    if (dp[1].size()) cout << "NO\n";
    else {
        cout << "YES\n";
        for (auto key : ans) cout << key.first << " " << key.second << '\n';
    }
    return 0;
}