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

const int N = 1e5 + 5;

typedef enum {NONE, SAME, SHORT, LONG} NodeType;
int n, f[N], d[N];
NodeType psh[N], cur[N];

vector<int> rem[N][4];
vector<pair<int, int>> ans;

void gg() {
    cout << "NO\n";
    exit(0);
} 

int solve(int u) {
    psh[u] = NONE;
    int res = 0;
    for (int i = SAME; i <= LONG; ++i) 
        sort(rem[u][i].begin(), rem[u][i].end(), [&](int x, int y){return d[x] < d[y];});
    {
        for (int i = 0, j, k; i < rem[u][SAME].size(); i = j) {
            for (j = i; d[rem[u][SAME][i]] == d[rem[u][SAME][j]] && j < rem[u][SAME].size(); ++j);
            for (k = i; k + 2 <= j; k += 2) ans.emplace_back(rem[u][SAME][k], rem[u][SAME][k + 1]);
            if (k < j) {
                if (res) gg();
                psh[u] = SAME;
                res = rem[u][SAME][k];
            }
        }
    }
    if (rem[u][SHORT].size() < rem[u][LONG].size()) {
        int diff = rem[u][LONG].size() - rem[u][SHORT].size();
        if (diff > 1 || res) gg();
        psh[u] = LONG;
        int j = 0;
        for (int i = 0; i < rem[u][SHORT].size(); ++i) {
            while (d[rem[u][LONG][j]] <= d[rem[u][SHORT][i]]) {
                if (res) gg();
                res = rem[u][LONG][j++];
            }
            ans.emplace_back(rem[u][SHORT][i], rem[u][LONG][j++]);
        }
        if (j < rem[u][LONG].size())
            res = rem[u][LONG][j];
    }
    else if (rem[u][SHORT].size() > rem[u][LONG].size()) {
        int diff = rem[u][SHORT].size() - rem[u][LONG].size();
        if (diff > 1 || res) gg();
        psh[u] = SHORT;
        int j = int(rem[u][SHORT].size()) - 1;
        for (int i = int(rem[u][LONG].size()) - 1; i >= 0; --i) {
            while (d[rem[u][SHORT][j]] >= d[rem[u][LONG][i]]) {
                if (res) gg();
                res = rem[u][SHORT][j--];
            }
            ans.emplace_back(rem[u][LONG][i], rem[u][SHORT][j--]);
        }
        if (j >= 0) res = rem[u][SHORT][j];
    }
    else {
        for (int i = 0; i < rem[u][SHORT].size(); ++i)
            if (d[rem[u][SHORT][i]] >= d[rem[u][LONG][i]]) gg();
            else ans.emplace_back(rem[u][SHORT][i], rem[u][LONG][i]);
    }   
    return res;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    cin >> n;
    for (int i = 2, x; i <= n; ++i) {
        cin >> x; cin >> f[x];
        d[x] = d[f[x]] + 1;
        static string s; cin >> s;
        if (s == "Tong"s) cur[x] = SAME;
        else if (s == "Duan"s) cur[x] = SHORT;
        else if (s == "Chang"s) cur[x] = LONG;
        else cur[x] = NONE;
    }
    for (int i = n; i; --i) {
        if (cur[i] != NONE) rem[i][cur[i]].emplace_back(i);
        int p = solve(i);
        if (p) {
            if (i == 1) gg();
            else rem[f[i]][psh[i]].emplace_back(p);
        }
    }
    cout << "YES\n";
    for (auto [x, y]: ans)
        cout << x << ' ' << y << '\n';
}