#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int N = 104;
const db vel = 340;
const int INF = 1e9;
map<string, int> mp;
PII p[N];
string s[N];
vector<pair<int, db>> g[N];
VI g2[N];
int n, m;
bool used[N];
VI tps;
bool shoot[N];

void clear()
{
	mp.clear();
	tps.clear();
	FOR (i, 0, n)
	{
		g[i].clear();
		g2[i].clear();
		used[i] = false;
		shoot[i] = false;
	}
}

	
db dis(int i, int j)
{
	db dx = p[i].F - p[j].F;
	db dy = p[i].S - p[j].S;
	return sqrt(dx * dx + dy * dy);
}

bool Belmann(int v)
{
	vector<db> dis(n, INF);
	dis[v] = 0;
	bool ok = false;
	FOR (i, 0, n)
	{
		ok = false;
		FOR (j, 0, n)
		{
			if (!shoot[j])
				continue;
			for (auto [to, d] : g[j])
			{	
				if (!shoot[to])
					continue;
				if (dis[j] + d < dis[to])
				{
					dis[to] = dis[j] + d;
					ok = true;
				}
			}
		}
	}
	FOR (i, 0, n)
	{
		if (i == v)
			continue;
		if (dis[i] < 0)
			g2[v].PB(i);
	}
	return !ok;
}

void dfs(int v)
{
	used[v] = true;
	for (auto to : g2[v])
		if (!used[to])
			dfs(to);
	if (shoot[v])
		tps.PB(v);
}


void solve()
{
	cin >> n >> m;
	FOR (i, 0, n)
	{
		cin >> s[i];
		mp[s[i]] = i;
		cin >> p[i].F >> p[i].S;
	}
	FOR (i, 0, m)
	{
		string t;
		cin >> t;
		int c = mp[t];
		cin >> t >> t;
		int a = mp[t];
		cin >> t >> t >> t;
		int b = mp[t];
		shoot[a] = true;
		shoot[b] = true;
		g[b].PB({a, dis(c, b) / vel - dis(c, a) / vel});
	}
	bool ok = true;
	FOR (i, 0, n)
	{
		if (shoot[i])
			ok &= Belmann(i);
		if (!ok)
		{
			cout << "IMPOSSIBLE\n";
			clear();
			return;
		}
	}
	FOR (i, 0, n)
	{
		if (!used[i])
			dfs(i);
	}
	reverse(ALL(tps));
	bool unique = true;
	FOR (i, 0, SZ(tps) - 1)
	{
		int v = tps[i];
		int u = tps[i + 1];
		bool is = false;
		for (auto to : g2[v])
			is |= to == u;
		unique &= is;
	}
	if (unique)
	{
		reverse(ALL(tps));
		FOR (i, 0, SZ(tps))
		{
			if (i)
				cout << ' ';
			cout << s[tps[i]];
		}
		cout << '\n';
		clear();
	}
	else
	{
		clear();
		cout << "UNKNOWN\n";
	}
}



int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int t;
	cin >> t;
	while (t--)
	{
		solve();
	}
	
	return 0;
}