#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#define time chrono::system_clock::now().time_since_epoch().count()
#include<ext/pb_ds/tree_policy.hpp>
#define clean(x) memset(x,0,sizeof(x))
#define fil(x,n) fill(x,x+1+n,0)
#define inf 2000000009
#define maxn 1000005
#define int long long
using namespace std;
using namespace __gnu_pbds;
mt19937_64 rnd(time);

int read() {
    int x=1,res=0;
    char c=getchar();
    while(c<'0'||c>'9') {
        if(c=='-') x=-1;
        c=getchar();
    }
    while(c>='0'&&c<='9') {
        res=res*10+(c-'0');
        c=getchar();
    }
    return res*x;
}
map<string,int>mp;

signed main()
{
    int n=read();
    int cnt=0,num=0;
    vector<vector<int>>g(n+1);
    vector<int>tp(n+1),dep(n+1);
    vector<array<int,3>>f(n+1);
    for(auto i:{"-","Chang","Duan","Tong"}) {
        mp[i]=++cnt;
    }
    for(int i=1;i<n;i++) {
        int aa=read(),bb=read();
        string c;cin>>c;
        g[bb].push_back(aa);
        tp[aa]=mp[c];
        if(mp[c]!=1) num++;
    }
    int ok=1;
    // if(num%2==1) {puts("NO");return 0;}
    vector<pair<int,int>>ans;
    auto dfs=[&](auto dfs,int x) -> void {
        set<pair<int,int>>cha,dua,ton;
        vector<pair<int,int>>res_ton,res_dua;
        if(tp[x]==2) cha.insert({dep[x],x});
        if(tp[x]==3) dua.insert({dep[x],x});
        if(tp[x]==4) ton.insert({dep[x],x});
        
        for(int i:g[x]) {
            dep[i]=dep[x]+1;
            dfs(dfs,i);
            if(f[i][0]==2) cha.insert({f[i][1],f[i][2]});
            if(f[i][0]==3) dua.insert({f[i][1],f[i][2]});
            if(f[i][0]==4) ton.insert({f[i][1],f[i][2]});
        }
        while(ton.size()>=2) {
            auto v=ton.begin();auto u=v;
            v++;
            if(u->first!=v->first) {res_ton.push_back({*u});ton.erase(u);}
            else {
                ans.push_back({u->second,v->second});
                ton.erase(v);
                ton.erase(u);
            } 
        }
        for(auto i:res_ton) ton.insert(i);
        while(cha.size()&&dua.size()) {
            auto u=dua.rbegin();
            auto v=cha.upper_bound(make_pair(u->first,1e9));
            if(v!=cha.end()) {
                ans.emplace_back(u->second,v->second);
                dua.erase(*u);
                cha.erase(v);
            }
            else {
                res_dua.push_back(*u);
                dua.erase(*u);
            }
        }
        for(auto i:res_dua) dua.insert(i);
        if(cha.size()+dua.size()+ton.size()>1) ok=0;
        else {
            if(cha.size()) {
                f[x][0]=2;
                f[x][1]=cha.begin()->first;
                f[x][2]=cha.begin()->second;
            }
            if(dua.size()) {
                f[x][0]=3;
                f[x][1]=dua.begin()->first;
                f[x][2]=dua.begin()->second;
            }
            if(ton.size()) {
                f[x][0]=4;
                f[x][1]=ton.begin()->first;
                f[x][2]=ton.begin()->second;
            } 
        }
        if(x==1&&cha.size()+dua.size()+ton.size()>=1) ok=0;
    };
    dep[1]=1;
    dfs(dfs,1);
    if(!ok) {
        puts("NO");
        return 0;
    } 
    else puts("YES");
    for(auto [u,v]:ans) cout<<u<<" "<<v<<endl;
    return 0;
}