#include // #include // #define int long long #define inf 1000000007 #define pa pair #define ll long long #define pal pair #define ppap pair #define PI 3.14159265358979323846 #define paa pair #define mp make_pair #define pb push_back #define EPS (1e-10) int dx[8]={0,1,0,-1,1,1,-1,-1}; int dy[8]={1,0,-1,0,-1,1,1,-1}; using namespace std; class pa3{ public: int x; int y,z; pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {} bool operator < (const pa3 &p) const{ if(x!=p.x) return x (const pa3 &p) const{ if(x!=p.x) return x>p.x; if(y!=p.y) return y>p.y; return z>p.z; //return x != p.x ? x (const pa4 &p) const{ if(x!=p.x) return x>p.x; if(y!=p.y) return y>p.y; if(z!=p.z)return z>p.z; return w>p.w; //return x != p.x ? x (const pa2 &p) const{ return x != p.x ? xb) return gcd(b,v); if(v==b) return b; if(b%v==0) return v; return gcd(v,b%v); } int mod; int extgcd(int a, int b, int &x, int &y) { if (b == 0) { x = 1; y = 0; return a; } int d = extgcd(b, a%b, y, x); y -= a/b * x; return d; } pa operator+(const pa & l,const pa & r) { return {l.first+r.first,l.second+r.second}; } pa operator-(const pa & l,const pa & r) { return {l.first-r.first,l.second-r.second}; } int pr[1200010]; int inv[1200010]; int beki(int wa,int rr,int warukazu){ if(rr==0) return 1%warukazu; if(rr==1) return wa%warukazu; wa%=warukazu; if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu; ll zx=beki(wa,rr/2,warukazu); return (zx*zx)%warukazu; } int comb(int nn,int rr){ if(rr<0 || rr>nn || nn<0) return 0; int r=pr[nn]*inv[rr]; r%=mod; r*=inv[nn-rr]; r%=mod; return r; } void gya(int ert){ pr[0]=1; for(int i=1;i<=ert;i++){ pr[i]=(pr[i-1]*i)%mod; } inv[ert]=beki(pr[ert],mod-2,mod); for(int i=ert-1;i>=0;i--){ inv[i]=inv[i+1]*(i+1)%mod; } } // cin.tie(0); // ios::sync_with_stdio(false); //priority_queue,greater> pq; //sort(ve.begin(),ve.end(),greater()); // mt19937(clock_per_sec); // mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) ; //----------------kokomade tenpure------------ vector G[200020]; struct unionfind{ private: public: vector par,ranks,kosuu,dekai; void shoki(int N){ par.resize(N+1,0); ranks.resize(N+1,0); dekai.resize(N+1,1); for(int i=0;i<=N;i++){ par[i]=i,dekai[i]=i; } } int de(int x){ return dekai[root(x)]; } int root(int x){ return par[x]==x ? x : par[x]=root(par[x]); } bool same(int x,int y){ return root(x)==root(y); } bool is_root(int x){ return x==root(x); } void unite(int x,int y){ x=root(x); y=root(y); if(x==y) return; if(ranks[x] G2[200020]; int R[200020]; ll kotae=1ll; void dfs(int v,int val=1){ for(auto ve:G2[v])dfs(ve,val+1); kotae*=(val+R[v])%inf; kotae%=inf; } signed main(){ cin.tie(0); ios::sync_with_stdio(false); int n; cin>>n; for(int i=1;i<=n;i++)cin>>R[i]; for(int i=0;i>y>>yy; G[y].pb(yy); G[yy].pb(y); } unionfind uf; uf.shoki(200020); for(int i=1;i<=n;i++){ for(auto v:G[i])if(v