#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define int long long
using i64 = long long;
mt19937_64 rd(time(0));
template <class K, class C = less<>> using paring_heap = __gnu_pbds::priority_queue<K, C>;
template <class K> using rb_tree = tree<K, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update>;
template <class T, class ... A> void debug(const T & t, const A & ... a) { cerr << "[" << t, ((cerr << ", " << a), ...), cerr << "]\n"; }
const i64 mod = [](bool n) { return n ? 998244353 : 1e9 + 7; } (1);

void QAQ() {
    int n, m, cnt = 0;
    cin >> n;

    vector adj(n + 1, vector<int>(m + 1));
    vector<int> a(n + 1), dep(n + 1);

    for (int i = 2, u, v; i <= n; i++) {
        string s;
        cin >> u >> v >> s;
        if (s[0] == '-') a[u] = 0;
        else if (s[0] == 'T') a[u] = 1;
        else if (s[0] == 'D') a[u] = 2;
        else a[u] = 3;
        cnt += !!a[u];
        adj[u].emplace_back(v), adj[v].emplace_back(u);
    }

    struct Info : multimap<array<int, 2>, int> {
        vector<array<int, 2>> res;
        Info(int op, int dep, int u) {
            if (op) insert({{op, dep}, u});
        }
        int merge(Info & dp, int op) {
            if (size() <= dp.size()) swap(dp);
            if (op) {
                for (auto & [_, v] : dp) {
                    auto & [sta, len] = _;
                    if (sta == 1) return -1;
                    if (sta == 2) {
                        if (begin() -> first[0] != 3) return -1;
                    } else if (sta == 3) {
                        if (begin() -> first[1] != 2) return -1;
                    }
                    res.emplace_back(array{begin() -> second, v});
                    erase(begin());
                }
                return 0;
            }
            for (auto & [_, v] : dp) {
                auto & [sta, len] = _;
                if (sta == 1) {
                    auto it = find(_);
                    if (it != end()) {
                        res.emplace_back(array{it -> second, v});
                        erase(it);
                    } else {
                        insert({_, v});
                    }
                } else if (sta == 2) {
                    auto it = upper_bound({3, len});
                    if (it != end()) {
                        res.emplace_back(array{it -> second, v});
                        erase(it);
                    } else {
                        insert({_, v});
                    }
                } else if (sta == 3) {
                    auto it = lower_bound({2, len});
                    if (it != begin()) {
                        it = prev(it);
                        if (it -> first[0] == 2 && it -> first[1] < len) {
                            res.emplace_back(array{it -> second, v});
                            erase(it);
                        } else {
                            insert({_, v});
                        }
                    } else {
                        insert({_, v});
                    }
                }
            }
            return 0;
        }
    };

    vector<array<int, 2>> ans;

    auto dsu_tr = [&](auto && self, int u, int fa = 0) -> Info {
        Info dp(a[u], dep[u] = dep[fa] + 1, u);
        for (auto & v : adj[u]) if (v != fa) {
            auto tmp = self(self, v, u); 
            if (tmp == Info(-1, -1, -1) || dp.merge(tmp, adj[u].size() == 1 + !!fa) == -1) {
                debug(u, fa, adj[u].size() == 1 + !!fa);
                return Info(-1, -1, -1);
            }
        }
        if (dp.size() > 1) return Info(-1, -1, -1);
        ans.insert(ans.end(), dp.res.begin(), dp.res.end());
        return move(dp);
    };

    if (dsu_tr(dsu_tr, 1) == Info(-1, -1, -1)) {
        cout << "NO\n";
        return;
    }
    if (ans.size() * 2 == cnt) {
        cout << "YES\n";
        for (auto & [u, v] : ans) {
            cout << u << " " << v << "\n";
        }
        return;
    }
    cout << "NO\n";
}

signed main() {
    cin.tie(0) -> sync_with_stdio(0);
    int t = 1;
    // cin >> t;
    for (cout << fixed << setprecision(12); t--; QAQ());
}