#include<bits/stdc++.h>
#ifndef xxx
#define dbg(...) ;
#endif
using namespace std;
template<class T> ostream &operator<<(ostream &o, const vector <T> &v) { bool f=false; for(T i:v) { f?o<<' ':o; o<<(i); f=true; } return o; }
template<class T> void sort(T &v) { std::sort(v.begin(), v.end()); }
template<class T, class C> void sort(T &v, C c) { std::sort(v.begin(), v.end(), c); }
template<class T> void reverse(T &v) { std::reverse(v.begin(), v.end()); }
template<class T> bool is_sorted(T &v) { return std::is_sorted(v.begin(), v.end()); }
template<class T> inline void left_shift(T st, T ed, int shift) { std::rotate(st, st+shift, ed); }
template<class T> inline void right_shift(T st, T ed, int shift) { std::rotate(st, ed-shift, ed); }
template<class T> inline void _min(T &x, const T &y) { x>y?x=y:x; }
template<class T> inline void _max(T &x, const T &y) { x<y?x=y:x; }
istream &operator>>(istream &i, __int128_t &x) { x=0; short f=1; char c=0; while(!isdigit(c)) { if(c=='-')f=-1; c=i.get(); } while(isdigit(c))x=x*10+c-'0', c=i.get(); x*=f; return i; }
ostream &operator<<(ostream &o, __int128_t x) { if(x==0) { o<<0; return o; } bool f=false; string s; if(x<0)f=true, x=-x; while(x)s+=x%10+'0', x/=10; reverse(s); if(f)o<<'-'; o<<s; return o; }
mt19937 mt(time(0));
typedef double db;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
constexpr int maxn=2e5+5;
constexpr int mod=1e9+7;
constexpr int inf=0x3f3f3f3f;
constexpr ll INF=0x3f3f3f3f3f3f3f3fll;
constexpr double pi=acos(-1.0);
constexpr double eps=1e-9;
struct node
{
	int id, type, dep;
	node() :id(0), type(0), dep(0) {}
	node(int id, int type, int dep)
	{
		this->id=id;
		this->type=type;
		this->dep=dep;
	}
}nd[maxn];
vector<int>G[maxn];
vector<int>layer[maxn];
// (dep,id)
set<pii>chang[maxn], duan[maxn], tong[maxn];
void dfs(int u)
{
	//dbg(u);
	layer[nd[u].dep].push_back(u);
	for(int v:G[u])
	{
		dfs(v);
	}
}
int main()//MARK: main
{
#ifndef xxx
	ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#endif
	cout<<fixed<<setprecision(10);
	int n;
	cin>>n;
	for(int i=1; i<=n-1; i++)
	{
		int id, type, dep;
		int p;
		string s;
		cin>>id>>p>>s;
		if(s[0]=='C')type=1;
		else if(s[0]=='D')type=2;
		else if(s[0]=='T')type=3;
		else type=0;
		dep=nd[p].dep+1;
		nd[id]=node(id, type, dep);
		G[p].push_back(id);
	}
	dfs(1);
	vector<pii>ans;
	auto getans=[&]()->bool
	{
		for(int d=n; d>=0; d--)
		{
			if(layer[d].empty())continue;
			//dbg(d);
			for(int u:layer[d])
			{
				auto [id, type, dep]=nd[u];
				auto &C=chang[u];
				auto &D=duan[u];
				auto &T=tong[u];
				for(int v:G[u])
				{
					C.insert(chang[v].begin(), chang[v].end());
					D.insert(duan[v].begin(), duan[v].end());
					T.insert(tong[v].begin(), tong[v].end());
				}
				if(type==1)C.insert({dep, u});
				else if(type==2)D.insert({dep, u});
				else if(type==3)T.insert({dep, u});
				//dbg(u, type, C.size(), D.size(), T.size());
				for(auto c=C.begin(); c!=C.end();)
				{
					auto it=D.lower_bound({c->first, 0});
					if(it!=D.begin())
					{
						it--;
						ans.push_back({c->second, it->second});
						D.erase(it);
						c=C.erase(c);
					}
					else
					{
						c++;
					}
				}
				for(auto t=T.begin(); t!=T.end();)
				{
					auto nex=next(t);
					if(nex!=T.end()&&nex->first==t->first)
					{
						ans.push_back({t->second, nex->second});
						t=T.erase(t);
						t=T.erase(t);
					}
					else
					{
						t++;
					}
				}
				if(C.size()+D.size()+T.size()>1)
				{
					return false;
				}
			}
		}
		return chang[1].empty()&&duan[1].empty()&&tong[1].empty();
	};
	if(getans())
	{
		cout<<"YES"<<'\n';
		for(auto [u, v]:ans)
		{
			cout<<u<<' '<<v<<'\n';
		}
	}
	else
	{
		cout<<"NO"<<'\n';
	}
	return 0;
}