import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int root(int[] uf, int u) {
  return (uf[u] < 0) ? u : (uf[u] = uf.root(uf[u]));
}
bool connect(int[] uf, int u, int v) {
  u = uf.root(u);
  v = uf.root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}

enum MO = 10L^^9 + 7;

int N;
long[] R;
int[] U, V;

int[][] G;
int[] depth;

void dfs(int u, int p, int d) {
  depth[u] = d;
  foreach (v; G[u]) {
    if (v != p) {
      dfs(v, u, d + 1);
    }
  }
}

void main() {
  try {
    for (; ; ) {
      N = readInt();
      R = new long[N];
      foreach (u; 0 .. N) {
        R[u] = readLong();
      }
      U = new int[N - 1];
      V = new int[N - 1];
      foreach (i; 0 .. N - 1) {
        U[i] = readInt() - 1;
        V[i] = readInt() - 1;
      }
      
      auto edges = new Tuple!(int, int)[N - 1];
      foreach (i; 0 .. N - 1) {
        if (U[i] < V[i]) {
          swap(U[i], V[i]);
        }
        edges[i] = tuple(U[i], V[i]);
      }
      edges.sort!((a, b) => (a[0] < b[0]));
      auto uf = new int[N];
      uf[] = -1;
      auto mx = iota(N).array;
      G = new int[][N];
      foreach (e; edges) {
        const u = uf.root(e[0]);
        const v = uf.root(e[1]);
        debug {
          writeln(e, ": ", mx[u], " ", mx[v]);
        }
        G[mx[u]] ~= mx[v];
        mx[u] = mx[v] = max(mx[u], mx[v]);
        uf.connect(u, v);
      }
      
      depth = new int[N];
      dfs(N - 1, -1, 0);
      debug {
        writeln(depth);
      }
      long ans = 1;
      foreach (u; 0 .. N) {
        ans *= (R[u] + (depth[u] + 1));
        ans %= MO;
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}