// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> inline void chkmax(T &x, T y) {x = max(x, y);}
template <typename T> inline void chkmin(T &x, T y) {x = min(x, y);}
template <typename T> inline void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	x *= f;
}
const int N = 1e5 + 10;
int n, a[N], l[N], r[N];
bool flag;
vector <int> v[N];
void dfs(int x) {
	if (a[x] != -1) {
		if (v[x].empty()) {
			l[x] = r[x] = a[x];
			return;
		}
		int s1 = 0, s2 = 0, s3 = 0;
		// 只能ai-1 只能 ai 都能
		for (int i: v[x]) {
			dfs(i);
			// chkmax(l[i], a[x] - 1);
			chkmin(r[i], a[x]);
			if (l[i] > r[i]) flag = false;//, debug << "~ " << x << " " << i << endl;
			if (r[i] < a[x] - 1) continue;
			if (l[i] == r[i]) {
				if (r[i] == a[x]) s2++;
				else s1++;
			} else {
				if (r[i] == a[x]) s3++;
				else s1++;
			}
			// if (l[i] < r[i]) s3++;
			// else if (r[i] == a[x]) s2++;
			// 	else s1++;
		}
		l[x] = r[x] = a[x];
		bool g = false;
		//恰好一个ax
		if (s2 == 1 || (s2 == 0 && s3)) g = true;
		//全是ax-1
		if (!s2 && s1 + s3 > 1) g = true;
		if (!g) flag = false;
	} else {
		if (v[x].empty()) {
			l[x] = 0, r[x] = 1e9;
			return;
		}
		int L = 0, cntl = 0;
		int R = 0, cntr = 0;
		for (int i: v[x]) {
			dfs(i);
			if (l[i] > L) {
				L = l[i], cntl = 1;
			} else if (l[i] == L) cntl++;
			if (r[i] > R) {
				R = r[i], cntr = 1;
			} else if (r[i] == R) cntr++;
		}
		l[x] = L + (cntl > 1);
		r[x] = R + (cntr > 1);
	}
	// debug << x << " " << l[x] << " " << r[x] << " " << flag << endl;
}
void zhk() {
	flag = true;
	read(n);
	F(i, 1, n) v[i].clear(), read(a[i]);
	F(i, 1, n - 1) {
		int x, y; read(x), read(y);
		v[x].push_back(y);
	}
	dfs(1);
	puts(flag ? "Reasonable" : "Unreasonable");
}
signed main() {
	int _ = 1;
	cin >> _;
	while (_--) zhk();
	return 0;
}
/* why?
*/