#include <algorithm>
#include <bits/stdc++.h>
#define sz(x) ((int)(x).size())
#define all(x) begin(x), end(x)
#ifdef memset0
#define log(...) fprintf(stderr, __VA_ARGS__)
#else
#define endl '\n'
#define log(...) (void(0))
#endif
using namespace std;
using ll = long long;
using lf = long double;
using ull = unsigned long long;

const int N = 1e5 + 9, inf = 1.02e9;
int T, n, l[N], r[N], a[N];
bool ok;
vector<int> g[N];

int calc(vector<int> q) {
  auto it = max_element(all(q));
  int mx = *it;
  *it = -1;
  if (*max_element(all(q)) == mx) {
    return mx + 1;
  } else {
    return mx;
  }
}

void dfs(int u) {
  if (g[u].empty()) {
    l[u] = 0, r[u] = inf;
  } else {
    vector<int> L, R;
    for (int v : g[u]) {
      dfs(v);
      L.emplace_back(l[v]);
      R.emplace_back(r[v]);
    }
    l[u] = calc(L);
    r[u] = calc(R);
  }

  if (a[u] != -1) {
    if (a[u] < l[u] || a[u] > r[u]) {
      ok = false;
    } else {
      l[u] = r[u] = a[u];
    }
  }
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> T;
  while (T--) {
    cin >> n;
    for (int i = 1; i <= n; i++) {
      g[i].clear();
      cin >> a[i];
      log("! ai = %d\n", a[i]);
    }
    for (int u, v, i = 1; i < n; i++) {
      cin >> u >> v;
      log("! %d %d\n", u, v);
      g[u].emplace_back(v);
    }
    ok = true;
    dfs(1);
    cout << (ok ? "Reasonable" : "Unreasonable") << endl;
  }
}