#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
int type[maxn];
int n;
vector<int>G[maxn];
int dep[maxn];
vector<pair<int,int> >anss;
bool cmp(int x,int y)
{
    return dep[x]<dep[y];
}
bool cmp2(pair<int,int> x,pair<int,int> y)
{
    return dep[x.first]==dep[y.first]?x.second<y.second:dep[x.first]<dep[y.first];
}
vector<pair<int,int> >pos;
stack<int>t;
pair<int,int> dfs(int u)
{   
    vector<int>a[4];
    //cout<<type[u]<<' '<<u<<endl;
    if(type[u])a[type[u]].push_back(u);
    for(auto v:G[u])
    {
        dep[v]=dep[u]+1;
        pair<int,int> cur=dfs(v);
        if(cur.first)a[cur.first].push_back(cur.second);
    }
    sort(a[1].begin(),a[1].end(),cmp);
    pair<int,int>ans=make_pair(0,0);
    for(int i=0;i<a[1].size();i++)
    {
        if(i+1<a[1].size()&&dep[a[1][i]]==dep[a[1][i+1]])anss.push_back(make_pair(a[1][i],a[1][i+1])),i++;
        else 
        {
            if(ans.first)
            {
                printf("NO\n");
                exit(0);
            }
            else ans.first=type[a[1][i]],ans.second=a[1][i];
        }
    }
    int cnt=0;
    if(ans.first)cnt=1;
    pos.clear();
    for(int i=0;i<a[2].size();i++)pos.push_back(make_pair(a[2][i],2));
    for(int i=0;i<a[3].size();i++)pos.push_back(make_pair(a[3][i],3));
    sort(pos.begin(),pos.end(),cmp2);
    for(auto s:pos)
    {
        if(s.second==3)
        {
            if(!t.empty())
            {
                anss.push_back(make_pair(s.first,t.top()));
                t.pop();
            }   
            else 
            {
                ans.first=3;
                ans.second=s.first;
                cnt++;
            }
        }
        else t.push(s.first);
    }
    while(!t.empty())
    {
        ans.first=2;
        ans.second=t.top();
        t.pop();
    }
    if(cnt>1)
    {
        printf("NO\n");
        exit(0);
    }
    return ans;
    
}
int main()
{
    scanf("%d",&n);
    for(int i=2;i<=n;i++)
    {
        int u,v;
        char op[10];
        scanf("%d%d%s",&u,&v,op);
        G[v].push_back(u);
        if(op[0]=='-')type[u]=0;
        else if(op[0]=='T')type[u]=1;
        else if(op[0]=='D')type[u]=2;
        else type[u]=3;
    }
    pair<int,int>ans=dfs(1);
    if(!ans.first)printf("YES\n");
    else 
    {
        printf("NO\n");
        return 0;
    }
    //cout<<anss.size()<<endl;
    for(auto p:anss)printf("%d %d\n",p.first,p.second);
}