#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define maxn 100005
#define put() putchar('\n')
#define Tp template<typename Ty>
#define Ts template<typename Ty,typename... Ar>
using namespace std;
inline void read(int &x){
    int f=1;x=0;char c=getchar();
    while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
    while (c>='0'&&c<='9') {x=x*10+c-'0';c=getchar();}
    x*=f;
}
namespace Debug{
	Tp void _debug(char* f,Ty t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,Ty x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	Tp ostream& operator<<(ostream& os,vector<Ty>& V){os<<"[";for(auto& vv:V) os<<vv<<",";os<<"]";return os;}
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
#define fi first
#define se second
#define mk make_pair
const int mod=1e9+7;
inline int power(int x,int y=mod-2) {
	int sum=1;
	while (y) {
		if (y&1) sum=sum*x%mod;
		x=x*x%mod;y>>=1;
	}
	return sum;
}
vector<int>to[maxn];
int n,a[maxn],l[maxn],r[maxn];
bool dfs(int x) {
	int flag=1,fl=0,Max1=0,Max2=0,sum1=0,sum2=0;
	for (auto y:to[x]) {
		flag&=dfs(y);
		Max1=max(Max1,l[y]);
		Max2=max(Max2,r[y]);
	}
	for (auto y:to[x]) {
		if (Max1==l[y]) sum1++;
		if (Max2==r[y]) sum2++;
	}
	if (!sum1&&!sum2) return 1;
	Max1+=(sum1>1);
	Max2+=(sum2>1);
	l[x]=max(l[x],Max1);
	r[x]=min(r[x],Max2);
	flag&=(l[x]<=r[x]);
//	gdb(x,l[x],r[x]);
	return flag; 
}
void solve(void) {
	int i,x,y;
	read(n);
	for (i=1;i<=n;i++) l[i]=0,to[i].clear();
	for (i=1;i<=n;i++) {
		read(a[i]);
		if (a[i]==-1) l[i]=0,r[i]=2e9;
		else l[i]=r[i]=a[i];
	}
	for (i=1;i<n;i++) read(x),read(y),to[x].push_back(y);
	int flag=dfs(1);
	puts(flag?"Reasonable":"Unreasonable");
}
signed main(void){
	int T;
	read(T);while (T--) solve();
	return 0;
}