#include<iostream>
#include<cstdio>
#define maxn 100005
#define inf 2000000000
using namespace std;
int T,n,u,v,val[maxn]; struct node{int to,nex;}a[maxn]; int head[maxn],cnt=0; bool top[maxn];
void add(int from,int to){a[++cnt].to=to; a[cnt].nex=head[from]; head[from]=cnt;}
bool dfs(int p){
	if(!head[p]){if(val[p]==-1) val[p]=0,top[p]=1; return 1;}
	int mmax=-1,num=1; bool flag=0; for(int i=head[p];i;i=a[i].nex){
		if(!dfs(a[i].to)) return 0; flag|=top[a[i].to];
		if(val[a[i].to]>mmax) mmax=val[a[i].to],cnt=1; else if(val[a[i].to]==mmax) cnt++;
	} int res=mmax+(cnt>1);
	if(val[p]==-1){if(flag) top[p]=1; val[p]=res; return 1;}
	if(res>val[p]) return 0; if(!flag&&val[p]!=res) return 0; return 1;
}
int main(){
	scanf("%d",&T); while(T--){
		scanf("%d",&n); cnt=0; for(int i=1;i<=n;i++) scanf("%d",&val[i]),head[i]=top[i]=0;
		for(int i=1;i<n;i++) scanf("%d%d",&u,&v),add(u,v);
		if(dfs(1)) printf("Reasonable\n"); else printf("Unreasonable\n");
	} return 0;
}