#include<bits/stdc++.h>
#define inf 1e9
#define eps 1e-6
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define REP(i,a,b) for(int i=a;i>=b;i--)
#define db double
#define ve vector<int>
#define pa pair<int,int>
#define fr first
#define sd second
#define pb push_back
#define mp make_pair
#define MEM(a) memset(a,0,sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
inline ll read()
{
	char ch = getchar();
	ll s = 0, w = 1;
	while (ch < '0' || ch > '9') {if (ch == '-')w = -1; ch = getchar();}
	while (ch >= '0' && ch <= '9') {s = s * 10 + ch - '0'; ch = getchar();}
	return s * w;
}
#define N 200010
int n, a[N], b[N];
bool tg[N];
int FLAG = 1;
vector<int>e[N];
void dfs(int x)
{
	int maxn = -1, mx = 0;
	bool t = 0;
//	cout << "GG:" << x << endl;
	for (int y : e[x])
	{
		dfs(y);
		if (!FLAG)return ;
		if (b[y] > maxn)maxn = b[y], mx = 1;
		else if (b[y] == maxn)mx ++;
		t |= tg[y];
	}
	if (mx == 0)b[x] = 0, tg[x] = 1;
	else if (mx == 1)b[x] = maxn, tg[x] = t;
	else b[x] = maxn + 1, tg[x] = t;

	if (a[x] != -1)
	{
		if (b[x] > a[x] || (b[x] != a[x] && (!tg[x]))) {FLAG = 0; return ;}
		else b[x] = a[x], tg[x] = 0;
	}
}
void sol()
{
	cin >> n;
	for (int i = 1; i <= n; i ++)cin >> a[i];
	for (int i = 1; i <= n - 1; i ++)
	{
		int x, y;
		cin >> x >> y;
		e[x].push_back(y);
	}
	FLAG = 1;
	dfs(1);
	if (!FLAG) {cout << "Unreasonable\n";}
	else cout << "Reasonable\n";
	for (int i = 1; i <= n; i ++)e[i].clear(), b[i] = tg[i] = 0;
}
signed main()
{
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int T; cin >> T;
	while (T --)sol();
	return 0;
}
/*
2
3
0 ‐1 0
1 2
2 3
3
0 ‐1 0
1 2
1 3
*/