#include <bits/stdc++.h>
using namespace std;
#define enl putchar('\n')
const int MAXN = 1e5 + 5;
typedef pair<int, int> pii;
int n, m;
string s;
struct EG {
    int to, nxt;
}e[MAXN];
int head[MAXN], etot;
inline void add(int u, int v) {
    e[etot] = { v,head[u] };
    head[u] = etot++;
}
struct FFF {
    vector<int>v;
    priority_queue<int>q1, q2;
}f[MAXN];
int fa[MAXN], dep[MAXN];
vector<pii>ans;
bool bfs() {
    vector<int>vec;
    queue<int>q;
    q.push(1);
    while (!q.empty()) {
        int u = q.front(); q.pop();
        vec.push_back(u);
        for (int i = head[u]; ~i; i = e[i].nxt) {
            q.push(e[i].to);
            dep[e[i].to] = dep[u] + 1;
        }
    }
    reverse(vec.begin(), vec.end());
    for (int u : vec) {
        int sizq1 = f[u].q1.size(), sizq2 = f[u].q2.size();
        if (abs(sizq1 - sizq2) > 1)return !printf("NO\n");
        int rst = -1;
        while (!f[u].q1.empty() && !f[u].q2.empty()) {
            int x = f[u].q1.top(), y = f[u].q2.top();
            f[u].q1.pop(); f[u].q2.pop();
            if (dep[x] >= dep[y]) {
                if (rst == -1) {
                    if (sizq1 > sizq2) {
                        rst = x;
                        x = f[u].q1.top();
                        f[u].q1.pop();
                    } else {
                        rst = y;
                        y = f[u].q2.top();
                        f[u].q2.pop();
                    }
                }
                return !printf("NO\n");
            }
            ans.push_back({ x,y });
        }
        if (rst != -1) {
            if (sizq1 > sizq2)f[u].q1.push(rst);
            else f[u].q2.push(rst);
        }
        if (f[u].v.size() + f[u].q1.size() + f[u].q2.size() > 1)
            return !printf("NO\n");
        if (!f[u].v.empty())f[fa[u]].v.push_back(f[u].v[0]);
        if (!f[u].q1.empty())f[fa[u]].q1.push(f[u].q1.top());
        if (!f[u].q2.empty())f[fa[u]].q2.push(f[u].q2.top());
        if (f[fa[u]].v.size() == 2) {
            int x = f[fa[u]].v.back(); f[fa[u]].v.pop_back();
            int y = f[fa[u]].v.back(); f[fa[u]].v.pop_back();
            ans.push_back({ x,y });
        }
    }
    if (f[1].v.size() || f[1].q1.size() || f[1].q2.size())
        return !printf("NO\n");
    return true;
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    memset(head, -1, sizeof(head));
    cin >> n;
    for (int i = 1; i < n; ++i) {
        int u, v;
        cin >> u >> v >> s;
        fa[u] = v;
        add(v, u);
        if (s == "Tong")f[u].v.push_back(u);
        else if (s == "Duan")f[u].q1.push(u);
        else if (s == "Chang")f[u].q2.push(u);
    }
    // for(int i=1;i<=n;++i,enl)
    //     for(int j=0;j<3;++j)
    //         // if(!f[i][j].empty())
    //             printf("%d ",f[i][j].size());
    if (bfs()) {
        printf("YES\n");
        for (auto [x, y] : ans)
            printf("%d %d\n", x, y);
    }
}