#include <bits/stdc++.h>
using namespace std;
const int maxn=2e5+10;
vector<pair<int,int>> ans;
void no(){
    // for(auto [x,y]:ans)cout<<x<<" "<<y<<"\n";
    cout<<"NO\n";exit(0);
}

set<int> s[3][maxn];
vector<int> ve[maxn];
int typ[maxn],dep[maxn];
int n;
void dfs(int x,int h){
    // cout<<"x="<<x<<" h="<<h<<"\n";
    dep[x]=dep[h]+1;
    set<int> now[3];
    for(auto it:ve[x]){
        dfs(it,x);
        for(int z=0;z<3;z++){
            for(auto it:s[z][it])now[z].insert(it);
        }
    }
    if(typ[x]!=-1)now[typ[x]].insert(x);
    map<int,int> ma;
    for(auto it:now[0]){
        if(ma.find(dep[it])!=ma.end()){
            ans.emplace_back(ma[dep[it]],it);
            ma.erase(dep[it]);
        }
        else ma[dep[it]]=it;
    }
    int res0=-1;
    if(ma.size()>0)res0=ma.begin()->second;
    set<pair<int,int>> s1,s2;
    for(auto it:now[1])s1.insert({dep[it],it});
    for(auto it:now[2])s2.insert({dep[it],it});
    auto it2=s1.end();
    while(it2!=s1.begin()){
        it2--;
        auto [d,x]=*it2;
        auto fd=s2.lower_bound({d+1,0});
        if(fd==s2.end()){
            it2--;continue;
        }
        ans.emplace_back(x,fd->second);
        s2.erase(fd);
        it2=s1.erase(it2);
    }
    if((int)ma.size()+(int)s1.size()+(int)s2.size()>1)no();
    if(res0!=-1)s[0][x].insert(res0);
    if(!s1.empty())s[1][x].insert(s1.begin()->second);
    if(!s2.empty())s[2][x].insert(s2.begin()->second);
    if(x==1){
        if((int)ma.size()+(int)s1.size()+(int)s2.size()>0)no();
    }
}
int main()
{
    // ios::sync_with_stdio(false);
    // cin.tie(0);
    memset(typ,-1,sizeof(typ));
    cin>>n;
    vector<int> v,t;
    for(int i=2;i<=n;i++){
        int x;cin>>x>>x;
        string s;
        cin>>s;
        ve[x].push_back(i);
        if(s=="Tong")typ[i]=0;
        if(s=="Duan")typ[i]=1;
        if(s=="Chang")typ[i]=2;
        if(s!="-")v.push_back(i);
    }
    // cout<<"cnt="<<cnt<<"\n";
    dfs(1,0);
    cout<<"YES\n";
    for(auto [x,y]:ans)cout<<x<<" "<<y<<"\n",t.push_back(x),t.push_back(y);
    sort(t.begin(),t.end());
    sort(v.begin(),v.end());
    // for(auto it:v)cout<<it<<" ";;cout<<"\n";
    // for(auto it:t)cout<<it<<" ";;cout<<"\n";
    assert(t==v);
    return 0;
}