#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double db;
const int N = 200005;

vector <int> G[N],p[3][N];
vector <pair <int,int> > ans;
pair <int,int> q[N]; // <type,id>
int n,dep[N];
int fail = 0;

void dfs(int u){
    for(int v : G[u]){
        dfs(v);
        auto [typ,w] = q[v];
        if(w) p[typ][u].push_back(w);
    }
    for(int i = 0;i < 3;i ++) sort(p[i][u].begin(),p[i][u].end(),[&](int x,int y){ return dep[x] < dep[y]; });
    // Tong
    q[u] = {-1,0};
    for(int i = 0;i < p[2][u].size();i += 2){
        if(i + 1 == p[2][u].size() || dep[p[2][u][i]] != dep[p[2][u][i + 1]]){
            if(q[u].second) fail = 1;
            else{
                q[u] = {2,p[2][u][i]};
                i --;
            }
        }
        else ans.push_back({p[2][u][i],p[2][u][i + 1]});
    }
    // Duan == Chang
    if(abs((int)(p[0][u].size()) - (int)(p[1][u].size())) >= 2 || (p[0][u].size() != p[1][u].size() && q[u].second)) fail = 1;
    if(p[0][u].size() == p[1][u].size()){
        for(int i = 0;i < p[0][u].size();i ++){
            if(dep[p[0][u][i]] < dep[p[1][u][i]]) ans.push_back({p[0][u][i],p[1][u][i]});
        }
    }
    // Duan < Chang
    if(p[0][u].size() + 1 == p[1][u].size()){
        int cur = 0;
        for(int i = 0;i < p[0][u].size();i ++){
            if(cur < p[1][u].size() && dep[p[0][u][i]] < dep[p[1][u][cur]]){
                ans.push_back({p[0][u][i],p[1][u][cur]});
                cur ++;
            }
            else{
                if(q[u].second) fail = 1;
                else{
                    q[u] = {1,p[1][u][cur]};
                    cur ++;
                }
            }
        }
        if(!q[u].second) q[u] = {1,p[1][u].back()};
    }
    // Duan > Chang
    if(p[1][u].size() + 1 == p[0][u].size()){
        int cur = p[0][u].size() - 1;
        for(int i = (int)(p[1][u].size()) - 1;i >= 0;i --){
            if(cur >= 0 && dep[p[0][u][cur]] < dep[p[1][u][i]]){
                ans.push_back({p[0][u][cur],p[1][u][i]});
                cur --;
            }
            else{
                if(q[u].second) fail = 1;
                else{
                    q[u] = {0,p[0][u][cur]};
                    cur --;
                }
            }
        }
        if(!q[u].second) q[u] = {0,p[0][u][0]};
    }
}

void solve(){
    int num = 0;
    cin >> n;
    dep[1] = 0;
    for(int i = 2;i <= n;i ++){
        int u,v; string str;
        cin >> u >> v >> str;
        // u == i
        G[v].push_back(u);
        dep[u] = dep[v] + 1;
        if(str == "Tong") p[2][u].push_back(u),num ++;
        if(str == "Duan") p[0][u].push_back(u),num ++;
        if(str == "Chang") p[1][u].push_back(u),num ++;
    }
    dfs(1);
    if(fail || (int)(ans.size()) * 2 < num) cout << "NO\n";
    else{
        cout << "YES\n";
        for(auto [u,v] : ans){
            cout << u << ' ' << v << '\n';
        }
    }
}

int main(){
    ios::sync_with_stdio(false);
    solve();
    return 0;
}