#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#ifdef APURBA
#include "DEBUG_TEMPLATE.h"
#else
#define HERE
#define debug(args...)
#endif
#define ALL(x) x.begin(),x.end()

const int N = 1e5 +5;
typedef pair<int,int> pii;


int n;
vector<int>adj[N];
int par[N];
int typ[N];
map<string,int>mp;
vector<pii>ans;

void no()
{
    cout<<"NO\n";
    exit(0);
}
bool comp(pii a, pii b)
{
    return a.second < b.second;
}

vector<int> dfs(int s)
{
    vector<pii>all[4];
    for(auto u:adj[s])
    {
        vector<int>cur = dfs(u);
        if(cur.size())
        {
            assert(cur.size()==3);
            all[cur[0]].push_back({cur[1],cur[2]+1});
        }
    }
    if(typ[s]!=0)
        all[typ[s]].push_back({s,0});
    for(int i=1; i<=3; i++)
        sort(all[i].begin(),all[i].end(),comp);

    vector<int> jabe ;

    {
        if(all[1].size() < all[2].size())
        {
            int p1 = (int)all[1].size() - 1;
            int p2 = (int)all[2].size() - 1;
            while(1)
            {
                if(p1 < 0 && p2 < 0)
                    break;
                if(p1 < 0)
                {
                    if(jabe.size())
                    {
                        no();
                    }
                    else
                    {
                        jabe = {2,all[2][p2].first,all[2][p2].second};
                    }
                    p2--;
                }
                else if(p2 < 0)
                {
                    if(jabe.size())
                    {
                        no();
                    }
                    else
                    {
                        jabe = {1,all[1][p1].first,all[1][p1].second};
                    }
                    p1--;
                }
                else
                {
                    if(all[1][p1].second > all[2][p2].second)
                    {
                        ans.push_back({all[1][p1].first,all[2][p2].first});
                        p1--;
                        p2--;
                    }
                    else
                    {

                        if(jabe.size())
                        {
                            no();
                        }
                        else
                        {
                            jabe = {2,all[2][p2].first,all[2][p2].second};
                        }
                        p2--;

                    }
                }
            }
        }
        else
        {
            int p1 = 0;
            int p2 = 0;
            while(1)
            {
                if(p1 == all[1].size()&& p2 ==all[2].size())
                    break;
                if(p1 == all[1].size())
                {
                    if(jabe.size())
                    {
                        no();
                    }
                    else
                    {
                        jabe = {2,all[2][p2].first,all[2][p2].second};
                    }
                    p2++;
                }
                else if(p2 == all[2].size())
                {
                    if(jabe.size())
                    {
                        no();
                    }
                    else
                    {
                        jabe = {1,all[1][p1].first,all[1][p1].second};
                    }
                    p1++;
                }
                else
                {
                    if(all[1][p1].second > all[2][p2].second)
                    {
                        ans.push_back({all[1][p1].first,all[2][p2].first});
                        p1++;
                        p2++;
                    }
                    else
                    {
                        if(jabe.size())
                        {
                            no();
                        }
                        else
                        {
                            jabe = {1,all[1][p1].first,all[1][p1].second};
                        }
                        p1++;
                    }
                }
            }
        }
    }

    {
        map<int,vector<int> >mp;
        for(auto it:all[3])
        {
            mp[it.second].push_back(it.first);
        }
        for(auto it:mp)
        {
            vector<int>tmp = it.second;
            if(tmp.size()%2)
            {
                if(jabe.size())
                    no();
                else
                {
                    jabe = {3, tmp.back(), it.first};
                    tmp.pop_back();
                }
            }
            for(int i=1; i<tmp.size(); i+=2)
            {
                ans.push_back({tmp[i-1],tmp[i]});
            }
        }
    }

    return jabe;
}

int32_t main()
{
#ifndef APURBA
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    mp["Chang"] = 1;
    mp["Duan"] = 2;
    mp["Tong"] = 3;
    mp["-"] = 0;
    cin>>n;
    for(int i=0; i<n-1; i++)
    {
        int u,v;
        cin>>u>>v;
        u--;
        v--;
        par[u] = v;
        adj[v].push_back(u);
        string s;
        cin>>s;
        assert(mp.count(s));
        typ[u] = mp[s];
    }
    vector<int> lol = dfs(0);
    if(lol.size())
    {
        cout<<"NO\n";
        return 0;
    }
    cout<<"YES\n";
    for(auto it:ans)
        cout<<it.first+1<<" "<<it.second+1<<"\n";
    return 0;
}