#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double;
const int N = 2e5 + 50;

using pii = pair<int, int>;
vector<pii> ans;
int n;
int t[N];
vector<int> e[N];
vector<int> depnodes[N];
int dep[N], mx_dep;

multiset<pii> s[5][N];

void dfs(int u, int fa)
{
    dep[u] = dep[fa] + 1;
    depnodes[dep[u]].push_back(u);
    for (auto v : e[u])
    {
        if (v == fa)
            continue;
        dfs(v, u);
    }
}

void work(int depth)
{
    for (auto u : depnodes[depth])
    {
        for (auto v : e[u])
        {
            if (dep[v] < dep[u])
                continue;
            for (int i = 1; i <= 3; i++)
            {
                for (auto k : s[i][v])
                    s[i][u].insert(k);
                s[i][v].clear();
            }
        }
        if (t[u])
            s[t[u]][u].insert(make_pair(depth, u));
        for (auto it = s[1][u].begin(); it != s[1][u].end() && !s[2][u].empty();)
        {
            auto it2 = s[2][u].lower_bound(*it);
            if (it2 != s[2][u].begin())
            {
                it2--;
                if (it2->first < it->first)
                {
                    ans.emplace_back(it->second, it2->second);
                    it = s[1][u].erase(it);
                    s[2][u].erase(it2);
                }
                else
                    it = next(it);
            }
            else
                it = next(it);
        }
        for (auto it = s[3][u].begin(); it != s[3][u].end() && next(it) != s[3][u].end();)
        {
            if (dep[it->second] == dep[next(it)->second])
            {
                ans.emplace_back(it->second, next(it)->second);
                it = s[3][u].erase(it);
                it = s[3][u].erase(it);
            }
            else
                it = next(it);
        }
        int sum_sz = 0;
        for (int i = 1; i <= 3; i++)
            sum_sz += s[i][u].size();
        if ((sum_sz >= 2) || (u == 1 && sum_sz >= 1))
        {
            cout << "NO\n";
            exit(0);
        }
    }
}

int main()
{
    scanf("%d", &n);
    int cnt_spec = 0;
    for (int i = 1; i < n; i++)
    {
        int ni, pi;
        char ti[10] = {0};
        scanf("%d%d%s", &ni, &pi, ti);
        t[ni] = (ti[0] == 'C' ? 1 : (ti[0] == 'D' ? 2 : (ti[0] == 'T' ? 3 : 0)));
        e[ni].push_back(pi), e[pi].push_back(ni);
        cnt_spec += (ti[0] != '-');
    }
    // if (cnt_spec % 2)
    //     return printf("NO\n"), 0;

    dfs(1, 0);
    mx_dep = *max_element(dep, dep + N);

    for (int d = mx_dep; d >= 1; d--)
        work(d);

    printf("YES\n");
    for (auto [x, y] : ans)
        printf("%d %d\n", x, y);

    return 0;
}