#include<bits/stdc++.h>

using namespace std;

vector<int> a;
vector<vector<int>> ver;
int n,Flag;

const int inf=1e9+1e6;

pair<int,int> dfs(int u){
	int l=0,r=0;
	if(!ver[u].size()){
		if(a[u]!=-1) l=r=a[u];
		return make_pair(0,inf);
	}
	int cnt=0;
	vector<pair<int,int>> tmp;
	for(auto p:ver[u]){
		auto T=dfs(p);
		if(Flag||T.first>T.second){
			Flag=1;
			return make_pair(inf,0);
		}
		tmp.emplace_back(T);
		l=max(l,T.first);
		r=max(r,T.second);
	}
	if(l>r) return make_pair(l,r);
	for(auto pt:tmp){
		if(pt.first==l) cnt++;
	}
	if(cnt>1) l++;
	cnt=0;
	for(auto pt:tmp){
		if(pt.second==r) cnt++;
	}
	if(cnt>1) r++;
	if(a[u]==-1) return make_pair(l,r);
	if(l<=a[u]&&a[u]<=r) return make_pair(a[u],a[u]);
	return make_pair(inf,0);
}

void solve(){
	cin>>n;
	a=vector<int>(n+1);
	for(int i=1; i<=n; i++){
		cin>>a[i];
	}
	
	ver=vector<vector<int>>(n+1);
	for(int i=1; i<n; i++){
		int x,y;
		cin>>x>>y;
		ver[x].emplace_back(y);
	}
	
	Flag=0;
	auto T=dfs(1);
	
	if(Flag==0&&T.first<=T.second) cout<<"Reasonable\n";
	else cout<<"Unreasonable\n";
}

int main(){
	
	cin.tie(0),cout.tie(0)->sync_with_stdio(false);
	
	int T;
	cin>>T;
	while(T--) solve();
	
	return 0;
}

/*

2
3
0 -1 0
1 2
2 3
3
0 -1 0
1 2
1 3

*/