#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#define REP(i, n) for (int i = 0; i < (n); i++)

using namespace std;

const int MOD = 1e9 + 7;

struct mint {
    int n;
    mint(int n_ = 0) : n(n_) {}
};

mint operator+(mint a, mint b) { a.n += b.n; if (a.n >= MOD) a.n -= MOD; return a; }
mint operator-(mint a, mint b) { a.n -= b.n; if (a.n < 0) a.n += MOD; return a; }
mint operator*(mint a, mint b) { return (long long)a.n * b.n % MOD; }
mint &operator+=(mint &a, mint b) { return a = a + b; }
mint &operator-=(mint &a, mint b) { return a = a - b; }
mint &operator*=(mint &a, mint b) { return a = a * b; }

int N, X[200000];
vector<int> G[200000];

int P[400000];
int L[400000];
int R[400000];
int K;
mint ans = 1;

int find(int x) {
  if (P[x] == x) return x;
  return P[x] = find(P[x]);
}

void unite(int x, int y) {
  x = find(x);
  y = find(y);
  L[K] = x;
  R[K] = y;
  P[x] = K;
  P[y] = K;
  K++;
}

void dfs(int u, int d) {
  if (u < N) {
    ans *= X[u] + d;
    return;
  }
  dfs(L[u], d);
  dfs(R[u], d+1);
}

int main() {
  cin >> N;
  REP(i, N) cin >> X[i];
  REP(i, N*2) {
    P[i] = i;
  }
  K = N;
  REP(i, N-1) {
    int u, v;
    cin >> u >> v;
    u--; v--;
    G[u].push_back(v);
    G[v].push_back(u);
  }
  REP(i, N) for (int j : G[i]) if (i > j) unite(i, j);
  dfs(K-1, 1);
  cout << ans.n << '\n';
}