//Linkwish's code
#include<bits/stdc++.h>
#define endl '\n'
#define si static inline
#define mp make_pair
#define fi first
#define se second
using namespace std;typedef long long ll;typedef __int128 li;
typedef pair<int,int> pii;typedef pair<ll,ll> pll;typedef const int ci;
typedef const ll cl;const int iinf=INT_MAX;const ll linf=LLONG_MAX;
template<typename T>si bool gmax(T &x,const T y){if(x<y)return x=y,1;return 0;}
template<typename T>si bool gmin(T &x,const T y){if(y<x)return x=y,1;return 0;}

namespace LinkWish{const int N=1e5+5;
	int T,n,a[N],l[N],r[N];vector<int>v[N];
	bool dfs(int u){
		int L=0,R=0,ls=0,rs=0;
		if(v[u].empty())R=1e9;
		for(auto i:v[u]){
			if(!dfs(i))return 0;
			if(l[i]>L)L=l[i],ls=1;else if(l[i]==L)ls++;
			if(r[i]>R)R=r[i],rs=1;else if(r[i]==R)rs++;
		}
		if(ls>1)L++;if(rs>1)R++;l[u]=L,r[u]=R;
		if(a[u]!=-1){
			if(a[u]<L||R<a[u])return 0;
			l[u]=r[u]=a[u];
		}
		return 1;
	}
	void mian(){
		cin>>T;
		while(T--){
			cin>>n;
			for(int i=1;i<=n;i++)cin>>a[i];
			for(int x,y,i=1;i<n;i++)cin>>x>>y,v[x].push_back(y);
			cout<<(dfs(1)?"Reasonable\n":"Unreasonable\n");
			for(int i=1;i<=n;i++)v[i].clear();
		}
	}
}

signed main(){
	#ifndef ONLINE_JUDGE
	freopen("in.in","r",stdin);
	#endif
//	ios::sync_with_stdio(0);
//	cin.tie(0),cout.tie(0);
	LinkWish::mian();
	return 0;
}