#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<vector<int>> G(n);
    vector<int> type(n);
    type[0] = 3;
    for (int _ = 0; _ < n - 1; _++) {
        int i, p;
        string t;
        cin >> i >> p >> t;
        i--, p--;
        if (t == "Chang")
            type[i] = 0;
        else if (t == "Duan")
            type[i] = 1;
        else if (t == "Tong")
            type[i] = 2;
        else
            type[i] = 3;
        G[p].emplace_back(i);
    }

    vector<pair<int, int>> ans;
    vector<int> dep(n);
    vector<bool> used(n, false);
    auto det = [&](int u, int v) {
        ans.emplace_back(u, v);
        used[u] = used[v] = true;
    };
    auto dfs = [&](auto self, int v, int d) -> int {
        dep[v] = d;
        vector<vector<int>> cand(3);
        for (int& u : G[v]) {
            int ch = self(self, u, d + 1);
            if (ch != -1) cand[type[ch]].emplace_back(ch);
        }
        if (type[v] < 2) cand[type[v]].emplace_back(v);
        if (abs(int(cand[0].size()) - int(cand[1].size())) > 1) {
            cout << "NO\n";
            exit(0);
        }
        sort(all(cand[0]), [&](int i, int j) { return dep[i] < dep[j]; });
        sort(all(cand[1]), [&](int i, int j) { return dep[i] < dep[j]; });
        if (cand[0].size() <= cand[1].size()) {
            reverse(all(cand[0]));
            reverse(all(cand[1]));
            for (int i = 0, j = 0; i < int(cand[0].size()); i++, j++) {
                while (j < int(cand[1].size()) and dep[cand[0][i]] <= dep[cand[1][j]]) j++;
                if (j == int(cand[1].size())) {
                    cout << "NO\n";
                    exit(0);
                }
                det(cand[0][i], cand[1][j]);
            }
        } else {
            for (int i = 0, j = 0; i < int(cand[1].size()); i++, j++) {
                while (j < int(cand[0].size()) and dep[cand[0][j]] <= dep[cand[1][i]]) j++;
                if (j == int(cand[0].size())) {
                    cout << "NO\n";
                    exit(0);
                }
                det(cand[1][i], cand[0][j]);
            }
        }
        map<int, vector<int>> mp;
        for (int& u : cand[2]) mp[dep[u]].emplace_back(u);
        for (auto p : mp) {
            auto& tmp = p.second;
            for (int i = 0; i + 1 < int(tmp.size()); i += 2) det(tmp[i], tmp[i + 1]);
        }
        int res = -1;
        for (int i = 0; i < 3; i++) {
            for (int& u : cand[i]) {
                if (used[u]) continue;
                if (res != -1) {
                    cout << "NO\n";
                    exit(0);
                }
                res = u;
            }
        }
        if (type[v] == 2) {
            if (res != -1) {
                cout << "NO\n";
                exit(0);
            }
            res = v;
        }
        return res;
    };
    if (dfs(dfs, 0, 0) != -1) {
        cout << "NO\n";
        return 0;
    }
    cout << "YES\n";
    for (auto [u, v] : ans) cout << u + 1 << ' ' << v + 1 << '\n';
    return 0;
}