#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 1e5 + 10;
int par[N], type[N];
vector<int> g[N];
int timer = 0;
int t_in[N], t_out[N];
int depth[N];

vector<int> level[N];
bool dead[N];

vector<pair<int, int>> ans;
int carry[N];

void dfs1(int v) {
    t_in[v] = ++timer;
    if (type[v] == 3) {
        level[depth[v]].push_back(v);
    }
    for (int to : g[v]) {
        depth[to] = depth[v] + 1;
        dfs1(to);
    }
    t_out[v] = ++timer;
}

bool dfs2(int v) {
    vector<pair<int, int>> up;
    set<pair<int, int>> down;
    for (int to : g[v]) {
        if (!dead[to]) {
            if (!dfs2(to)) {
                return false;
            }
            if (carry[to]) {
                if (type[carry[to]] == 1) {
                    down.emplace(depth[carry[to]], carry[to]);
                } else if (type[carry[to]] == 2) {
                    up.emplace_back(depth[carry[to]], carry[to]);
                } else {
                    assert(false);
                }
            }
        }
    }
    if (type[v] == 1) {
        down.emplace(depth[v], v);
    } else if (type[v] == 2) {
        up.emplace_back(depth[v], v);
    }
    sort(up.begin(), up.end());
    vector<int> extra_up, extra_down;
    while (!up.empty()) {
        auto [dep, u] = up.back();
        up.pop_back();
        auto it = down.upper_bound({dep, 0});
        if (it == down.end()) {
            extra_up.push_back(u);
        } else {
            ans.emplace_back(u, it->second);
            down.erase(it);
        }
    }
    for (auto [dep, u] : down) {
        extra_down.push_back(u);
    }
    if (extra_down.size() + extra_up.size() >= 2) {
        return false;
    } else if (!extra_down.empty()) {
        carry[v] = extra_down[0];
    } else if (!extra_up.empty()) {
        carry[v] = extra_up[0];
    }
    return true;
}

bool solve(int n) {
    dfs1(1);
    for (int d = 0; d <= n; d++) {
        if (level[d].size() & 1) {
            return false;
        }
        for (int i = 0; i < level[d].size(); i += 2) {
            int u = level[d][i];
            int v = level[d][i + 1];
            ans.emplace_back(u, v);
            while (depth[u] > depth[v]) {
                if (dead[u]) {
                    return false;
                }
                dead[u] = true;
                u = par[u];
            }
            while (depth[u] < depth[v]) {
                if (dead[v]) {
                    return false;
                }
                dead[v] = true;
                v = par[v];
            }
            while (u != v) {
                if (dead[u] || dead[v]) {
                    return false;
                }
                dead[u] = dead[v] = true;
                u = par[u];
                v = par[v];
            }
        }
    }
    dead[1] = true;
    for (int i = 1; i <= n; i++) {
        if (dead[i]) {
            if (!dfs2(i)) {
                return false;
            }
        }
    }
    return true;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
#endif

    int n;
    cin >> n;
    for (int i = 2; i <= n; i++) {
        int waste;
        string t;
        cin >> waste >> par[i] >> t;
        if (t == "-") {
            type[i] = 0;
        } else if (t == "Chang") {
            type[i] = 1;
        } else if (t == "Duan") {
            type[i] = 2;
        } else {
            type[i] = 3;
        }
        g[par[i]].push_back(i);
    }

    if (solve(n)) {
        cout << "YES\n";
        for (auto [u, v] : ans) {
            cout << u << " " << v << "\n";
        }
    } else {
        cout << "NO\n";
    }

#ifdef LOCAL
    cout << "\nTime elapsed: " << double(clock()) / CLOCKS_PER_SEC << " s.\n";
#endif
}