#include <bits/stdc++.h>

using namespace std;

const int maxn = 1e5 + 5;

int n;
int a[maxn];
int dep[maxn], tong[maxn];
vector<pair<int, int> > ans;
vector<int> tree[maxn];

inline int dfsTong(int u, int d){
    dep[u] = d;
    vector<int> vec;
    for(auto v: tree[u]){
        int res = dfsTong(v, d + 1);
        if(~res){
            tong[v] = true;
            vec.push_back(res);
        }
    }
    sort(vec.begin(), vec.end(), [&](const int &i, const int &j){ return dep[i] < dep[j]; });
    int res = -1;
    for(int i = 0; i < vec.size(); ){
        if(i + 1 == vec.size()){
            if(~res){ puts("NO"); exit(0); }
            res = vec[i], ++i;
        }
        else{
            if(dep[vec[i + 1]] == dep[vec[i]]) ans.push_back(make_pair(vec[i], vec[i + 1])), i += 2;
            else{
                if(~res){ puts("NO"); exit(0); }
                res = vec[i], ++i;
            }
        }
    }

    if(a[u] == 1){
        if(~res){ puts("NO"); exit(0); }
        res = u;
    }
    return res;
}

inline vector<int> erase(const vector<int> &vec, int p){
    vector<int> ret;
    assert(p >= 0 && p < vec.size());
    for(int i = 0; i < vec.size(); ++i) if(i != p) ret.push_back(vec[i]);
    return ret;
}

inline bool check(vector<int> &A, vector<int> &B){
    assert(A.size() == B.size());
    for(int i = 0; i < A.size(); ++i) if(dep[A[i]] >= dep[B[i]]) return false;
    return true;
}

inline pair<int, int> dfs(int u){
    vector<int> vDuan, vChang;
    for(auto v: tree[u]){
        pair<int, int> res = dfs(v);
        if(tong[v] && res.first != -1){ puts("NO"); exit(0); }
        if(res.first == 0) vDuan.push_back(res.second);
        if(res.first == 2) vChang.push_back(res.second);
    }
    if(a[u] == 0) vDuan.push_back(u);
    if(a[u] == 2) vChang.push_back(u);

    sort(vDuan.begin(), vDuan.end(), [&](const int &i, const int &j){ return dep[i] < dep[j]; });
    sort(vChang.begin(), vChang.end(), [&](const int &i, const int &j){ return dep[i] < dep[j]; });

    pair<int, int> ret = make_pair(-1, 0);

    if(vDuan.size() == vChang.size()){
        for(int i = 0; i < vDuan.size(); ++i){
            if(dep[vDuan[i]] < dep[vChang[i]]){
                ans.push_back(make_pair(vDuan[i], vChang[i]));
            }
            else{ puts("NO"); exit(0); }
        }
        return ret;
    }
    else if(vDuan.size() == vChang.size() + 1){
        int lb = -1, rb = vDuan.size();
        for(; lb + 1 < rb; ){
            int md = (lb + rb) >> 1;
            vector<int> vDuan_ = erase(vDuan, md);
            if(check(vDuan_, vChang)) rb = md;
            else lb = md;
        }
        if(rb == vDuan.size()){ puts("NO"); exit(0); }
        ret = make_pair(0, vDuan[rb]);
        vDuan = erase(vDuan, rb); assert(vDuan.size() == vChang.size());
        for(int i = 0; i < vDuan.size(); ++i) ans.push_back(make_pair(vDuan[i], vChang[i]));
        return ret;
    }
    else if(vChang.size() == vDuan.size() + 1){
        int lb = -1, rb = vChang.size();
        for(; lb + 1 < rb; ){
            int md = (lb + rb) >> 1;
            vector<int> vChang_ = erase(vChang, md);
            if(check(vDuan, vChang_)) lb = md;
            else rb = md;
        }
        if(lb == -1){ puts("NO"); exit(0); }
        ret = make_pair(2, vChang[lb]);
        vChang = erase(vChang, lb); assert(vDuan.size() == vChang.size());
        for(int i = 0; i < vDuan.size(); ++i) ans.push_back(make_pair(vDuan[i], vChang[i]));
        return ret;
    }
    else{ puts("NO"); exit(0); }
}

int main(){
    scanf("%d", &n);
    a[0] = -1;
    for(int it = 1; it < n; ++it){
        int i, p; scanf("%d%d", &i, &p);
        char buf[15]; scanf("%s", buf);
        --i, --p;
        tree[p].push_back(i);
        if(buf[0] == 'D') a[i] = 0;
        else if(buf[0] == 'T') a[i] = 1;
        else if(buf[0] == 'C') a[i] = 2;
        else a[i] = -1;
    }

    if(~dfsTong(0, 0)){ puts("NO"); return 0; }

    if(~dfs(0).first){ puts("NO"); return 0; }

    puts("YES");
    for(auto p: ans) printf("%d %d\n", p.first + 1, p.second + 1);
    return 0;
}