#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 depth[N];

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

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

bool used[N];

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

bool dfs2(int v) {
    used[v] = true;
    vector<pair<int, int>> up;
    vector<pair<int, int>> down;
    for (int to : g[v]) {
        if (!dead[to] && !used[to]) {
            if (!dfs2(to)) {
                return false;
            }
            if (carry[to]) {
                if (type[carry[to]] == 1) {
                    down.emplace_back(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_back(depth[v], v);
    } else if (type[v] == 2) {
        up.emplace_back(depth[v], v);
    }
    sort(up.begin(), up.end());
    sort(down.begin(), down.end());
    if (abs(int(up.size()) - int(down.size())) >= 2) {
        return false;
    } else if (up.size() == down.size()) {
        set<pair<int, int>> s;
        for (auto it : down) {
            s.insert(it);
        }
        while (!up.empty()) {
            auto [dep, u] = up.back();
            up.pop_back();
            auto it = s.lower_bound({dep + 1, 0});
            if (it == s.end()) {
                return false;
            } else {
                ans.emplace_back(u, it->second);
                s.erase(it);
            }
        }
    } else if (up.size() == down.size() + 1) {
        set<pair<int, int>> s;
        for (auto it : up) {
            s.insert(it);
        }
        for (auto [dep, u] : down) {
            auto it = s.lower_bound({dep, 0});
            if (it == s.begin()) {
                return false;
            } else {
                it--;
                ans.emplace_back(u, it->second);
                s.erase(it);
            }
        }
        assert(s.size() == 1);
        carry[v] = s.begin()->second;
    } else if (up.size() + 1 == down.size()) {
        set<pair<int, int>> s;
        for (auto it : down) {
            s.insert(it);
        }
        while (!up.empty()) {
            auto [dep, u] = up.back();
            up.pop_back();
            auto it = s.lower_bound({dep + 1, 0});
            if (it == s.end()) {
                return false;
            } else {
                ans.emplace_back(u, it->second);
                s.erase(it);
            }
        }
        assert(s.size() == 1);
        carry[v] = s.begin()->second;
    } else {
        assert(false);
    }
    return true;
}

bool solve(int n) {
    dfs1(1);
    dead[1] = true;
    for (int d = 0; d <= n; d++) {
        if (level[d].size() & 1) {
            return false;
        }
        vector<pair<int, int>> cur;
        for (int v : level[d]) {
            cur.emplace_back(v, v);
        }
        while (!cur.empty()) {
            vector<pair<int, int>> nxt;
            sort(cur.begin(), cur.end());
            for (int i = 0; i < cur.size(); i++) {
                if (i + 1 < cur.size() && cur[i].first == cur[i + 1].first) {
                    ans.emplace_back(cur[i].second, cur[i + 1].second);
                    i++;
                } else {
                    if (dead[cur[i].first]) {
                        return false;
                    } else {
                        dead[cur[i].first] = true;
                        nxt.emplace_back(par[cur[i].first], cur[i].second);
                    }
                }
            }
            swap(cur, nxt);
        }
    }
    for (int i = 1; i <= n; i++) {
        if (!used[i]) {
            if (!dfs2(i) || carry[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
}