#include<bits/stdc++.h>
using namespace std;
#define fi first
#define sc second
#define pii pair<int,int>
#define pdd pair<double,double>
#define pb push_back
#define umap unordered_map
#define mset multiset
#define pq priority_queue
#define ull unsigned long long
#define i128 __int128
#define ld long double
#define fixs fixed<<setprecision
#define FileIn(x) freopen(x".in","r",stdin)
#define FileOut(x) freopen(x".out","w",stdout)
#define FileIO(x) FileIn(x),FileOut(x);
const int maxn=1e6+10;
const int mod=1e9+7;
struct Dsu{
    int f[maxn];
    void init(int n){
        for(int i=1;i<=n;i++) f[i]=i;
    }
    int find(int x){
        if(f[x]!=x) f[x]=find(f[x]);
        return f[x];
    }
    void merge(int u,int v){
        int fu=find(u),fv=find(v);
        if(fu!=fv) f[fu]=fv;
    }
}d;
int n,a[maxn],res[maxn],cnt,ls[maxn],rs[maxn];
vector<int> g[maxn];
void dfs(int u){
    if(ls[u]) res[ls[u]]+=res[u],dfs(ls[u]);
    if(rs[u]) res[rs[u]]+=res[u],dfs(rs[u]);
}
void solve(){
    cin>>n,d.init(n*2),cnt=n;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=1,u,v;i<n;i++) cin>>u>>v,g[u].pb(v),g[v].pb(u);
    for(int i=1;i<=n;i++){
        for(int j:g[i]){
            if(j>i) continue;
            int fu=d.find(i),fv=d.find(j);
            ls[++cnt]=fu,rs[cnt]=fv,d.merge(fu,cnt),d.merge(fv,cnt);
        }
        res[d.find(i)]++;
    }
    dfs(d.find(1));
    // for(int i=1;i<=n;i++) cerr<<res[i]<<" ";cerr<<endl;
    int ans=1;
    for(int i=1;i<=n;i++) ans=1ll*ans*(res[i]+a[i])%mod;
    cout<<ans<<endl;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--) solve();
    return 0;
}
/*
Samples
input:

output:

THINGS TODO:
检查freopen，尤其是后缀名
检查空间
检查调试语句是否全部注释
*/