代码打印

#include <bits/stdc++.h>
#define int long long
using namespace std;
struct t1
{
	int l,r,id;
}t[200005];
vector<int>a[200005],c[200005];
typedef pair<int,int> pii;
priority_queue<pii>q;
int d[200005];
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T;
	cin>>T;
	while(T--)
	{
		int n,m;
		cin>>n>>m;
		for(int i=1;i<=n;i++)
		{
			a[i].clear();
			c[i].clear();
			t[i].l=1;
			t[i].r=n-1;
			t[i].id=i;
		}
		bool f=true;
		while(m--)
		{
			int v,x,p;
			cin>>v>>x>>p;
			if(p==0)
			{
				t[v].r=x;
			}
			else
			{
				t[v].l=x;
			}
			if(t[v].l>t[v].r)
			{
				f=false;
			}
		}
		if(f==false)
		{
			cout<<"Ugly"<<"\n";
			continue;
		}
		for(int i=2;i<=n;i++)
		{
			a[t[i].l].push_back(t[i].id);
		}
		d[0]=1;
		int tot=0;
		for(int i=1;i<n;i++)
		{
			for(int j:a[i])
			{
				tot++;
				q.emplace(-t[j].r,j);
			}
			if(tot==n-1)
			{
				break;
			}
			if(q.empty())
			{
				f=false;
				break;
			}
			else
			{
				int x=-1;
				while(q.size())
				{
					x=q.top().second;
					q.pop();
					if(t[x].r<i)
					{
						c[d[t[x].r-1]].push_back(x); 
						x=-1;
					}
					else
					{
						break;
					}
				}
				if(x==-1)
				{
					f=false;
					break;
				}
				d[i]=x;
				c[d[i-1]].push_back(x);
			}
		}
		int x;
		while(q.size())
		{
			x=q.top().second;
			q.pop();
			if(t[x].r<n)
			{
				c[d[t[x].r-1]].push_back(x); 
			}
			else
			{
				break;
			}
		}
		if(f==false)
		{
			cout<<"Ugly"<<"\n";
		}
		else
		{
			cout<<"Beautiful"<<"\n";
			for(int u=1;u<=n;u++)
			{
				for(int v:c[u])
				{
					cout<<u<<" "<<v<<"\n";
				}
			}
		}
	}
	return 0;
}
//