#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=200010;
const int mod=1e9+7;
int n;
int a[N];
int id[N];
vector<int>G[N];
vector<int>T[N];
bool cmp(int x,int y){
	return a[x]<a[y];
}
int fa[N];
int find(int x){
	if(fa[x]==x)return x;
	return fa[x]=find(fa[x]);
}
void merge(int x,int y){
	fa[find(x)]=find(y);
	return;
}
int dep[N],siz[N],son[N],top[N];
void dfs1(int u,int f){
	dep[u]=dep[f]+1;
	fa[u]=f;
	siz[u]=1;
	for(auto v:G[u]){
		if(v==f)continue;
		dfs1(v,u);
		siz[u]+=siz[v];
		if(siz[son[u]]<siz[v])son[u]=v;
	}
	return;
}
void dfs2(int u,int f){
	top[u]=f;
	if(son[u])dfs2(son[u],f);
	for(auto v:G[u]){
		if(v==fa[u])continue;
		if(v==son[u])continue;
		dfs2(v,v);
	}
	return;
}
int lca(int x,int y){
	while(top[x]!=top[y]){
		if(dep[top[x]]<dep[top[y]])
			swap(x,y);
		x=fa[top[x]];
	}
	if(dep[x]<dep[y])return x;
	return y;
}
int dis(int x,int y){
	return dep[x]+dep[y]-2*dep[lca(x,y)];
}
int r[N];
int dp[N];
void dfs(int u){
    for(auto v:T[u]){
        dp[v]+=dp[u];
        dfs(v);
    }
	return;
}
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
    for(int i=1;i<=n;i++)cin>>r[i];
	for(int i=1;i<=n;i++)fa[i]=i;
	for(int i=1;i<n;i++){
		int u,v;
		cin>>u>>v;
		G[u].push_back(v);
		G[v].push_back(u);
	}
	for(int i=1;i<=n;i++)id[i]=i;
	sort(id+1,id+n+1,cmp);
	for(int i=1;i<=n;i++){
		for(auto v:G[i]){
			if(v>i)continue;
			int t=find(v);
			if(i==t)continue;
			T[i].push_back(t);
			merge(t,i);
		}
        dp[find(i)]++;
	}
    dfs(n);
    int ans=1;
    for(int i=1;i<=n;i++)ans=ans*(r[i]+dp[i])%mod;
    cout<<ans<<"\n";
	return 0;
}
/*

*/