#include<bits/stdc++.h>
using namespace std;
using ll=long long;
template<typename T>
ostream& operator << (ostream &out,const vector<T>&x){
	if(x.empty())return out<<"[]";
	out<<'['<<x[0];
	for(int len=x.size(),i=1;i<len;i++)out<<','<<x[i];
	return out<<']';
}
template<typename T>
vector<T> ary(const T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<typename T>
void debug(T x){
	cerr<<x<<'\n';
}
template<typename T,typename ...S>
void debug(T x,S ...y){
	cerr<<x<<' ',debug(y...);
}
const int N=1e5+10,INF=1e9;
int T,n,a[N],mn[N],mx[N];
vector<int>to[N];
void ins(int &x,int &y,int z){
	if(z>x)y=x,x=z;
	else y=max(y,z);
}
bool ans;
void dfs(int u,int fa=0){
	int a1=-1,a2=-1,b1=-1,b2=-1;
	for(int v:to[u])if(v^fa){
		dfs(v,u);
		ins(a1,a2,mn[v]);
		ins(b1,b2,mx[v]);
	}
	if(!~a1){
		mn[u]=0,mx[u]=INF;
	}else{
		mn[u]=a1==a2?a1+1:a1;
		mx[u]=b1==b2?b1+1:b1;
	}
	if(~a[u]){
		ans&=mn[u]<=a[u]&&a[u]<=mx[u];
		mn[u]=mx[u]=a[u];
	}
}
void clr(){
	for(int i=1;i<=n;i++)to[i].clear();
}
void get(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	for(int i=1,u,v;i<n;i++){
		scanf("%d%d",&u,&v);
		to[u].push_back(v),to[v].push_back(u);
	}
	ans=1;
	dfs(1);
	puts(ans?"Reasonable":"Unreasonable");
}
int main(){
	for(scanf("%d",&T);T--;clr())get();
	return 0;
}