#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int M = 1e5 + 5;
const int mod = 998244353;
int n, k, a[M], opt[M], dep[M];
vector<int> g[M];
vector<pair<int, int>> ans;


int dfs(int x, int fa) {
    dep[x] = dep[fa] + 1;

    vector<int> chang, duan, tong;

    if (opt[x] == 1) chang.push_back(x);
    if (opt[x] == 2) duan.push_back(x);
    if (opt[x] == 3) tong.push_back(x);

    for (int y : g[x]) {
        if (y == fa) continue;
        int t = dfs(y, x);
        if (t == -1) continue;
        if (opt[t] == 1) chang.push_back(t);
        if (opt[t] == 2) duan.push_back(t);
        if (opt[t] == 3) tong.push_back(t);
    }
    sort(chang.begin(), chang.end(), [](const int&x, const int&y) {
        return dep[x] < dep[y];
    });
    sort(duan.begin(), duan.end(), [](const int&x, const int&y) {
        return dep[x] > dep[y];
    });
    sort(tong.begin(), tong.end(), [](const int&x, const int&y) {
        return dep[x] > dep[y];
    });

    int node = -1;
    int cnt = 0;

    if (tong.size() & 1) {
        node = tong.back();
        cnt = 1;
    }

    for (int i = 0; i < (int)tong.size() - 1; i += 2) {
        if (dep[tong[i]] == dep[tong[i + 1]]) {
            ans.push_back({tong[i], tong[i + 1]});
        } else {
            cnt ++;
            node = tong[i];
            i -= 1;
        }
    }

    if (cnt > 1) {
        cout << "NO" << endl;
        exit(0);
    }

    if (chang.size() > duan.size()) {
        if (chang.size() != duan.size() + 1 || cnt) {
            cout << "NO" << endl;
            exit(0);
        }
        int i = 0, j = 0;
        for (;j < duan.size(); j++, i++) {
            ans.push_back({chang[i], duan[i]});
        }
        return chang.back();
    } else if (chang.size() < duan.size()) {
        if (duan.size() != chang.size() + 1 || cnt) {
            cout << "NO" << endl;
            exit(0);
        }
        int i = 0, j = 0;
        for (;j < chang.size(); j++, i++) {
            ans.push_back({chang[i], duan[i]});
        }
        return duan.back();
    } else {
        int i = 0, j = 0;
        for (;j < chang.size(); j++, i++) {
            ans.push_back({chang[i], duan[i]});
        }      
    }
    if (cnt) {
        // cout << "111: " << node << endl;
        return node;
    }
    return -1;
}


signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    
    cin >> n;

    int cnt = 1;

    for (int i = 1; i < n; i++) {
        int x, y; string ts;
        cin >> x >> y >> ts;
        g[x].push_back(y);
        g[y].push_back(x);
        if (ts[0] == 'C') opt[x] = 1;
        else if (ts[0] == 'D') opt[x] = 2;
        else if (ts[0] == 'T') opt[x] = 3;
        else cnt++;
    }

    if (n - cnt & 1) {
        cout << "NO" << endl;
        return 0;
    }

    dfs(1, 0);

    cout << "YES" << endl;
    
    for (auto [x, y] : ans) {
        cout << x << " " << y << endl;
    }

    return 0;
}