#include <bits/stdc++.h>
#include <bits/extc++.h> 
using namespace std;
#define sz(x) (int)(x).size()
#define rep(i, l, r) for (int i = l; i < (r); i++)
#define all(x) begin(x), end(x)

using ll = long long;
using vi = vector<int>;

using pii = pair<int, int>;

using ld = long double;
const ld inf = 2e18;

int main() {
    int n;cin >> n;
    vector<vi> g(n);
    vector<int> a(n, 0);// - : 0, Chang(>) : 1, Duan(<) : 2, Tong(=) : 3
    rep(i, 0, n-1) {
        int ii, p;string s;cin >> ii >> p >> s;
        ii--;
        p--;
        g[ii].emplace_back(p);
        g[p].emplace_back(ii);
        if (s[0] == '-') {
            a[ii] = 0;
        }
        else if(s[0] == 'C') {
            a[ii] = 1;
        }
        else if (s[0] == 'D') {
            a[ii] = 2;
        }
        else {
            a[ii] = 3;
        }
    }
    vector<pii> ans; vi depth(n, -1);
    auto dfs = [&](auto self, int v, int p)->tuple<bool, int> {
        vi C, D, T;
        if (a[v] == 1)C.emplace_back(v);
        else if (a[v] == 2)D.emplace_back(v);
        else if (a[v] == 3)T.emplace_back(v);

        for (int u : g[v]) {
            if (u == p) continue;
            depth[u] = depth[v] + 1;
            auto [flag, x] = self(self, u, v);
            if (!flag)return {0, -1};
            if (x != -1) {
                if (a[x] == 1)C.emplace_back(x);
                else if (a[x] == 2)D.emplace_back(x);
                else if (a[x] == 3)T.emplace_back(x);
            }

        }

        if (abs(sz(C) - sz(D)) + (sz(T) % 2) > 1) return {0, -1};

        vi rest;
        int i = 0;
        sort(all(T), [&](int i, int j){return depth[i] < depth[j];});
        while(i < sz(T)) {
            if (i + 1 < sz(T) && depth[T[i]] == depth[T[i+1]]) {
                ans.emplace_back(T[i], T[i+1]);
                i += 2;
            }
            else {
                rest.emplace_back(T[i]);
                i += 1;
            }
        }
        if (sz(C) <= sz(D)) {
            vector<pii> E;
            for(auto x:D)E.emplace_back(x, 1);
            for(auto x:C)E.emplace_back(x, 0);
            sort(all(E), [&](pii i, pii j) {
                if (depth[i.first] == depth[j.first]) return i.second < j.second;
                else return depth[i.first] < depth[j.first];
            });
            stack<int> st;
            // cout << v + 1 << endl;
            for (auto [x, t] : E) {
                // cout << "x, t " << x+1 << " " << t << endl;
                if (t == 1) {
                    st.push(x);
                }
                else {
                    if (st.empty()) return {0, -1};
                    ans.emplace_back(st.top(), x);
                    st.pop();
                }
            }

            if (!st.empty())rest.emplace_back(st.top());
        }
        else {
            vector<pii> E;
            for(auto x:D)E.emplace_back(x, 1);
            for(auto x:C)E.emplace_back(x, 0);
            sort(all(E), [&](pii i, pii j) {
                if (depth[i.first] == depth[j.first]) return i.second < j.second;
                else return depth[i.first] < depth[j.first];
            });
            stack<int> st;
            reverse(all(E));
            // cout << v + 1 << endl;
            for (auto [x, t] : E) {
                // cout << "x, t " << x+1 << " " << t << endl;
                if (t == 0) {
                    st.push(x);
                }
                else {
                    if (st.empty()) return {0, -1};
                    ans.emplace_back(st.top(), x);
                    st.pop();
                }
            }

            if (!st.empty())rest.emplace_back(st.top()); 
        }
        // cout << v + 1 << " :";for(auto x:rest)cout << x + 1 << " " ;cout << endl;
        if (sz(rest) > 1) return {0, -1};
        else if (sz(rest) == 1) return {1, rest.front()};
        else return {1, -1};
    };

    depth[0] = 0;
    auto [flag, x] = dfs(dfs, 0, -1);

    if (flag && x == -1) {
        cout << "YES" << endl;
        for(auto [x, y] : ans) {
            cout << x + 1 << " " << y + 1 << endl;
        }
    }
    else {
        cout << "NO" << endl;
    }

}