#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>

vector<vector<ll>> adj(100000);
vector<char> type(100000, '-');


bool valid = true;
vector<array<ll,2>> out;

vector<tuple<char,ll,ll>> treecur(ll n, ll p, ll d) {
    vector<tuple<char,ll,ll>>  meeting;
    if(type[n] != '-') meeting.push_back({type[n], d, n});
    for(auto a: adj[n]) {
        if(a != p) {
            for(auto x: treecur(a,n,d+1)) meeting.push_back(x);
        }
    }


    if(meeting.size() <= 1) {
        return meeting;
    }

    vector<tuple<char,ll,ll>> tout = {};

    map<ll,ll> ts = {};

    set<pll> cs;

    vector<pll> ds;

    for(auto x: meeting) {
        char c = get<0>(x);
        ll d = get<1>(x), n = get<2>(x);
        
        if(c == 'T') {
            if(ts.find(d) == ts.end()) ts[d] = n;
            else {
                out.push_back({n, ts[d]}); ts.erase(d);
            }
        }


        if(c == 'C') {
            cs.insert({d,n});
        }

        if(c == 'D') ds.push_back({d,n});
    }

    sort(ds.rbegin(), ds.rend());

    for(auto d: ds) {
        // match to c with greater depth
        auto it = cs.upper_bound({d.first, -1});
        if(it == cs.end()) {
            tout.push_back({'D',d.first,d.second});
        } else {
            out.push_back({d.second, (*it).second});
            cs.erase(it);
        }
    }

    for(auto c: cs) tout.push_back({'C',c.first,c.second});
    for(auto t: ts) tout.push_back({'T',t.first,t.second});

    
    if(tout.size() > 1) {
        valid = false;
    }
    return tout;
}

int main() {
    ll N; cin >> N;
    
    for(ll i = 0; i < N-1; i++) {
        ll a, b; cin >> a >> b; a--; b--;
        adj[a].push_back(b); adj[b].push_back(a);
        string S; cin >> S;
        type[a]=S[0];
    }

    treecur(0,-1,0);
    if(valid) {
        cout << "YES\n";
        for(auto xy: out) {
            cout << xy[0]+1 << " " << xy[1]+1 << "\n";
        }
    } else {
        cout << "NO\n";
    }

}