#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using mint = modint1000000007;
const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<int>r(n);
	rep(i, n)cin >> r[i];
	vector<vector<int>>to(n);
	rep(i, n - 1) {
		int a, b; cin >> a >> b; a--, b--;
		to[a].push_back(b);
		to[b].push_back(a);
	}
	set<int>st;
	vector<long long>s(n);
	auto dfs = [&](auto self, int v, int p = -1)->void {
		vector<int>vec;
		while ((st.size())&&((*st.begin()) < v)) {
			vec.push_back(*st.begin());
			st.erase(st.begin());
		}
		st.insert(v);
		for (auto nv : to[v]) {
			if (p == nv)continue;
			self(self, nv, v);
			while ((st.size()) && ((*st.begin()) < v)) {
				st.erase(st.begin());
			}
		}
		s[v] += st.size();
		rep(i, vec.size())st.insert(vec[i]);
	};
	dfs(dfs, 0);
	rep(i, n)reverse(all(to[i]));
	st.clear();
	auto dfs2 = [&](auto self, int v, int p = -1)->void {
		vector<int>vec;
		while ((st.size()) && ((*st.begin()) < v)) {
			vec.push_back(*st.begin());
			st.erase(st.begin());
		}
		s[v] += st.size();
		for (auto nv : to[v]) {
			if (p == nv)continue;
			self(self, nv, v);
			while ((st.size()) && ((*st.begin()) < v)) {
				st.erase(st.begin());
			}
		}
		rep(i, vec.size())st.insert(vec[i]);
		st.insert(v);
	};
	dfs2(dfs2, 0);
	mint ans = 1;
	rep(i, n)ans *= s[i] + r[i];
	cout << ans.val() << endl;
	return 0;
}