#include <bits/stdc++.h>
using namespace std;
vector<int>D[100009];
char tab[100009];
int odl[100009];
int g[100009];
int n,IleUwu=0;
vector<pair<int,int>>ODP;
vector<pair<int,int>>usun(vector<pair<int,int>>A, int ind)
{
    vector<pair<int,int>>W;
    for(int i=0;i<ind;i++)
    {
        W.push_back(A[i]);
    }
    for(int i=ind+1;i<A.size();i++)
    {
        W.push_back(A[i]);
    }
    return W;
}
void DFS(int v, int last)
{
    for(int som : D[v])
    {
        if(som!=last)
        {
            odl[som]=odl[v]+1;
            DFS(som,v);
        }
    }
    vector<pair<int,int>>A,B,C;
    if(g[v]!=0)
    {
        if(tab[v]=='C'){A.push_back({odl[v],v});}
        else if(tab[v]=='D'){B.push_back({odl[v],v});}
        else if(tab[v]=='T'){C.push_back({odl[v],v});}
    }
    for(int som : D[v])
    {
        if(som==last){continue;}
        if(g[som]!=0)
        {
            if(tab[g[som]]=='C'){A.push_back({odl[g[som]],g[som]});}
            else if(tab[g[som]]=='D'){B.push_back({odl[g[som]],g[som]});}
            else if(tab[g[som]]=='T'){C.push_back({odl[g[som]],g[som]});}
        }
    }
    if((A.size()!=B.size()||C.size()%2==1)&&v==1){cout<<"NO"<<'\n';exit(0);}
    if((C.size()%2==1&&A.size()!=B.size())||abs((int)A.size()-(int)B.size())>1){cout<<"NO"<<'\n';exit(0);}
    if(C.size()%2==0&&A.size()==B.size()){C.push_back({-1,0});}
    sort(A.begin(),A.end());
    sort(B.begin(),B.end());
    sort(C.begin(),C.end());
    if(C.size()%2==1)
    {
        bool cv=1;
        while(C.size()>0)
        {
            if(C.size()==1||(C[C.size()-2].first!=C[C.size()-1].first))
            {
                if(cv==0){cout<<"NO"<<'\n';exit(0);}
                else{cv=0;g[v]=C.back().second;C.pop_back();}
                continue;
            }
            ODP.push_back({C[C.size()-2].second,C[C.size()-1].second});
            C.pop_back();
            C.pop_back();
        }
        for(int i=0;i<A.size();i++)
        {
            if(A[i].first<=B[i].first){cout<<"NO"<<'\n';exit(0);}
            ODP.push_back({A[i].second,B[i].second});
        }
    }
    else
    {
        while(C.size()>0)
        {
            if(C[C.size()-2].first!=C[C.size()-1].first){cout<<"NO"<<'\n';exit(0);}
            ODP.push_back({C[C.size()-2].second,C[C.size()-1].second});
            C.pop_back();
            C.pop_back();
        }
        if(A.size()==B.size()+1)
        {
            int usu=0;
            for(int i=0;i<B.size();i++)
            {
                if(A[i].first<=B[i].first)
                {
                    break;
                }
                usu=i+1;
            }
            g[v]=A[usu].second;
            A=usun(A,usu);
            for(int i=0;i<B.size();i++)
            {
                if(A[i].first<=B[i].first){cout<<"NO"<<'\n';exit(0);}
                ODP.push_back({A[i].second,B[i].second});
            }
        }
        else if(A.size()+1==B.size())
        {
            reverse(A.begin(),A.end());
            reverse(B.begin(),B.end());
            int usu=0;
            for(int i=0;i<A.size();i++)
            {
                if(A[i].first<=B[i].first)
                {
                    break;
                }
                usu=i+1;
            }
            g[v]=B[usu].second;
            B=usun(B,usu);
            for(int i=0;i<A.size();i++)
            {
                if(A[i].first<=B[i].first){cout<<"NO"<<'\n';exit(0);}
                ODP.push_back({A[i].second,B[i].second});
            }
        }
    }
}
int main()
{ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin>>n;
    for(int i=2;i<=n;i++)
    {
        string Z;
        int a,b;
        cin>>a>>b>>Z;
        D[a].push_back(b);
        D[b].push_back(a);
        IleUwu++;
        g[i]=i;
        if(Z=="Chang")
        {
            tab[i]='C';
        }
        else if(Z=="Duan")
        {
            tab[i]='D';
        }
        else if(Z=="Tong")
        {
            tab[i]='T';
        }
        else if(Z=="-")
        {
            g[i]=0;
            IleUwu--;
            tab[i]='-';
        }
    }
    DFS(1,-1);
    cout<<"YES"<<'\n';
    for(pair<int,int>xd : ODP)
    {
        cout<<xd.first<<" "<<xd.second<<'\n';
    }
    return 0;
}