#include <bits/stdc++.h>

#define ll long long
#define endl '\n'
#define For(i,l,r) for(int i=l;i<=r;i++)
#define ForD(i,r,l) for(int i=r;i>=l;i--)
#define REP(i,l,r) For(i,l,r-1)
#define PER(i,r,l) ForD(i,r-1,l)
#define ff first
#define ss second
#define pb emplace_back
#define all(x) x.begin(),x.end()
#define sz(a) (signed)a.size()

#ifdef NCGM
#include"debug.h"
#else 
#define debug(...) "fr";
#endif
    
using namespace std;

const int N=5002,MAX=10000;

vector<int> adj[N];
int a[N],b[N];
bool vs[N];
ll res=0;
void dfs(int u,int cur) {
	if (vs[u]) return;
	vs[u]=1;
	if (b[u]%cur) b[u]=cur,res+=cur;
	for(auto v: adj[u]) {
		if (!vs[v]) dfs(v,cur);
	}
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n;
    cin >> n;
    For(i,1,n) cin >> a[i];
    For(i,1,n-1) {
    	int a,b;
    	cin >> a >> b;
    	adj[a].pb(b);
    	adj[b].pb(a);
    }
    ll ans=LLONG_MAX;
    For(i,2,MAX) {
    	res=0;
    	For(j,1,n) b[j]=a[j];
    	For(j,1,n) vs[j]=0;
    	dfs(1,i);
    	ans=min(ans,res);
    }
    cout << ans;
    return 0;
}