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

#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
template <typename ...T>
void debug_(const char *s, T ...a) {
    cerr << "\e[1;32m(" << s << ") = (";
    int cnt = sizeof...(T);
    (..., (cerr << a << (--cnt ? ", " : ")\e[0m\n")));
}
template <typename I>
void orange_(const char *s, I L, I R) {
    cerr << "\e[1;32m[ " << s << " ] = [ ";
    for (int f = 0; L != R; ++L)
        cerr << (f++ ? ", " : "") << *L;
    cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    vector<int> dep(n);
    vector<int> p(n);

    vector<pair<int,int>> ans;

    map<int,int> tong;

    vector<pair<int,int>> L, S;

    for (int i = 1; i < n; i++) {
        int z;
        string t;
        cin >> z >> p[i] >> t;
        --p[i];
        dep[i] = dep[p[i]] + 1;
        if (t == "Tong") {
            if (auto it = tong.find(dep[i]); it != tong.end()) {
                ans.emplace_back(it->second, i);
                tong.erase(it);
            } else {
                tong[dep[i]] = i;
            }
        } else if (t == "Chang") {
            L.emplace_back(dep[i], i);
        } else if (t == "Duan") {
            S.emplace_back(dep[i], i);
        }
    }

    sort(L.begin(), L.end());
    sort(S.begin(), S.end());

    if (L.size() != S.size()) {
        cout << "NO\n";
        return 0;
    }
    if (!tong.empty()) {
        cout << "NO\n";
        return 0;
    }

    for (size_t i = 0; i < L.size(); i++) {
        if (L[i].first <= S[i].first) {
            cout << "NO\n";
            return 0;
        }
        ans.emplace_back(L[i].second, S[i].second);
    }

    cout << "YES\n";
    for (auto [x, y]: ans) {
        cout << x + 1 << ' ' << y + 1 << '\n';
    }

    return 0;
}