//#pragma GCC optimize(3,"Ofast","inline")
//#pragma GCC optimize("-Ofast","-funroll-all-loops")
#include<bits/stdc++.h>
//#define getchar nc
#define sight(c) ('0'<=c&&c<='9')
#define swap(a,b) a^=b,b^=a,a^=b
#define LL long long
#define debug(a) cout<<#a<<" is "<<a<<"\n"
#define dput(a) puts("a")
#define eho(x) for(int i=head[x];i;i=net[i])
#define fi first
#define se second
inline char nc(){
static char buf[1000000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,1000000,stdin),p1==p2)?EOF:*p1++;
}
template <class T>
inline void read(T &x){// unsigned
    static char c;
    for (c=getchar();!sight(c);c=getchar());
    for (x=0;sight(c);c=getchar())x=x*10+c-48;
}
template <class T> void write(T x){if (x<10) {putchar('0'+x); return;} write(x/10); putchar('0'+x%10);}
template <class T> inline void writeln(T x){ if (x<0) putchar('-'),x*=-1; write(x); putchar('\n'); }
template <class T> inline void writel(T x){ if (x<0) putchar('-'),x*=-1; write(x); putchar(' '); }
using namespace std;
#define pii pair<int,int> 
#define pb push_back
#define N 200007
int n,f[N],dep[N];
char ch[N][17];
vector<int> V[N];
vector<pii> ans,Vd,Vc;
bool check(const vector<int> &duan, const vector<int> &chang) {
    int n=duan.size();
    if ((int)chang.size()!=n) return false;
    for (int i=0;i<n;i++) 
		if (dep[duan[i]]>=dep[chang[i]]) return false;
    return true;
}
bool cmp(int u, int v) {return dep[u] < dep[v];}
int dfs(int u) {
    vector<int> chang, duan;
    map<int, int> tong;
    V[u].pb(u);
    for (auto v:V[u]) {
        int x = v;
        if (v!=u) {
            dep[v] = dep[u] + 1;
            x = dfs(v);
        }
        if (!x) continue;
        if (ch[x][0] == 'C') chang.push_back(x);
        else if (ch[x][0] == 'D') duan.push_back(x);
        else if (ch[x][0] == 'T') {
            if (tong[dep[x]]) {
                ans.push_back({tong[dep[x]], x});
                tong[dep[x]] = 0;
            } else {
                tong[dep[x]] = x;
            }
        }
    }
    sort(duan.begin(), duan.end(), cmp);
    sort(chang.begin(), chang.end(), cmp);
    int D = duan.size(), C = chang.size();
    vector<int> odd;
    for (auto Z: tong) if (Z.se) odd.push_back(Z.se);
    if ((int) odd.size() > 1) {
        printf("NO\n");
        exit(0);
    }
    if ((int) odd.size() == 1) {
        if (!check(duan, chang)) {
            printf("NO\n");
            exit(0);
        }
        for(int i=0;i<min(C, D);i++) ans.push_back({duan[i], chang[i]});
        return odd[0];
    }
    if (abs(D - C) > 1) {
    	printf("NO\n");
    	return 0;
    }
    if (D == C) {
        if (!check(duan, chang)) {
            printf("NO\n");
    		return 0;
        }
        for(int i=0;i<min(C, D);i++) ans.push_back({duan[i], chang[i]});
        return 0;
    }
    int res = -1;
    if (D == C + 1) {
        int l = 0, r = D - 1;
        while (l <= r) {
            int mid = (l + r) >> 1;
            auto n_duan = duan;
            n_duan.erase(n_duan.begin() + mid);
            if (check(n_duan, chang)) {
                res = duan[mid];
                r = mid - 1;
            } else {
                l = mid + 1;
            }
        }
        duan.erase(find(duan.begin(), duan.end(), res));
    } else {
        int l = 0, r = C - 1;
        while (l <= r) {
            int mid = (l + r) >> 1;
            auto n_chang = chang;
            n_chang.erase(n_chang.begin() + mid);
            if (check(duan, n_chang)) {
                res = chang[mid];
                l = mid + 1;
            } else {
                r = mid - 1;
            }
        }
        chang.erase(find(chang.begin(), chang.end(), res));
    }
    if (res == -1) {
        printf("NO\n");
        exit(0);
    }
    for(int i=0;i<min(C, D);i++) ans.push_back({duan[i], chang[i]});
    return res;
}
signed main() {
	#ifdef LOCAL
	//	freopen("test.in", "r", stdin);
	//	freopen("test.out", "w", stdout);
	#endif
    scanf("%d",&n);
    for(int i=2;i<=n;i++) {
    	scanf("%d%d%s",&i,&f[i],ch[i]);
        V[f[i]].push_back(i);
    }
    if (dfs(1)) {
       	printf("NO\n");
    	return 0;
    }
    printf("YES\n");
    for (auto Z:ans)
    	printf("%d %d\n",Z.fi,Z.se);
    return 0;
}