#include<bits/stdc++.h>

#define rep(i, x, y) for(int i=x;i<=y;i++)
#define per(i, x, y) for(int i=x;i>=y;i--)
using namespace std;
#define int long long
const int N = 2e5 + 10;
const int mod = 998244353;
int n, flag[N], dep[N], g[N];
vector<array<int, 2>> e[N];
vector<array<int, 2>> ans;
bool ok = 1;

void dfs(int u, int fa) {
    array<vector<int>, 4> tmp;
    for (auto [v, mark]: e[u]) {
        if (v == fa)continue;
        flag[v] = mark;
        dep[v] = dep[u] + 1;
        dfs(v, u);
        if (g[v])tmp[flag[g[v]]].push_back(g[v]);
    }
    if (flag[u])tmp[flag[u]].push_back(u);
    sort(tmp[1].begin(), tmp[1].end(), [&](int x, int y) {
        return dep[x] < dep[y];
    });
    sort(tmp[2].begin(), tmp[2].end(), [&](int x, int y) {
        return dep[x] < dep[y];
    });
    sort(tmp[3].begin(), tmp[3].end(), [&](int x, int y) {
        return dep[x] < dep[y];
    });
    vector<int> rem;
    for (int i = 0; i < tmp[3].size(); i++) {
        if (i + 1 == tmp[3].size()) {
            rem.push_back(tmp[3][i]);
            break;
        }
        int u = tmp[3][i], v = tmp[3][i + 1];
        if (dep[u] == dep[v]) {
            ans.push_back({u, v});
            i++;
        } else rem.push_back(u);
    }
    set<array<int, 2>> s;
    for (auto x: tmp[2])s.insert({dep[x], x});
    for (auto u: tmp[1]) {
        if (s.size() == 0) {
            rem.push_back(u);
            break;
        }
        auto it = s.lower_bound({dep[u], 0});
        if (it != s.begin()) {
            auto [_, v] = *prev(it);
            ans.push_back({u, v});
            s.erase({dep[v], v});
        } else rem.push_back(u);
    }
    for (auto [x, y]: s)rem.push_back(y);
    if (rem.size() > 1)ok = 0;
    if (rem.size() == 1)g[u] = rem[0];
}

void solve() {
    cin >> n;
    int cnt = 0, x = 0, y = 0;
    rep(i, 1, n - 1) {
        int u, v;
        string s;
        cin >> u >> v >> s;
        int mark = 0;
        if (s == "Chang")mark = 1, y++;
        if (s == "Duan")mark = 2, y--;
        if (s == "Tong")mark = 3, x++;
        e[u].push_back({v, mark});
        e[v].push_back({u, mark});
        cnt += (mark != 0);
    }
    if (cnt % 2 == 1 or x % 2 == 1 or y != 0)cout << "NO\n";
    else {
        dfs(1, 0);
        if (not g[1] or not ok) {
            cout << "YES\n";
            for (auto [u, v]: ans)cout << u << " " << v << "\n";
        } else cout << "NO\n";
    }
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int tc = 1;
    //cin >> tc;
    for (int i = 1; i <= tc; i++) {
        solve();
    }
}