#include<bits/stdc++.h>
using namespace std;
 
#define debug(x) cerr << #x << ": " << (x) << endl
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define dwn(i,a,b) for(int i=(a);i>=(b);i--)
#define pb push_back
#define all(x) (x).begin(), (x).end()
 
#define x first
#define y second
using pii = pair<int, int>;
using ll = long long;
 
inline void read(int &x){
    int s=0; x=1;
    char ch=getchar();
    while(ch<'0' || ch>'9') {if(ch=='-')x=-1;ch=getchar();}
    while(ch>='0' && ch<='9') s=(s<<3)+(s<<1)+ch-'0',ch=getchar();
    x*=s;
}

const int N=5050, M=N*2-10;

int f[N][M];
int n, w[N];
vector<int> g[N];

bool vis[M];
vector<int> d[M];

void init(int n){
	rep(i, 2, n){
		if(!vis[i]) d[i].pb(i);
		for(int j=i+i; j<=n; j+=i){
			vis[j]=true;
			if(!vis[i]) d[j].pb(i);
		}
	}
}

void dfs(int u, int fa){
	rep(i, 2, M-1) f[u][i]=(i==w[u]? 0: i);
	for(auto go: g[u]) if(go!=fa){
		dfs(go, u);
		rep(i, 2, M-1){	
			for(auto e: d[i]){
				f[u][i]+=f[go][e];
			}
		}
	}
	rep(i, 2, M-1){
		for(int j=i+i; j<M; j+=i) f[u][i]=min(f[u][i], f[u][j]);
	}
}

void solve(){
	init(M-1);
	cin>>n;
	rep(i, 1, n) read(w[i]);
	
	rep(i, 1, n-1){
		int u, v; read(u), read(v);
		g[u].pb(v), g[v].pb(u);
	}	
	memset(f, 0x3f, sizeof f);
	dfs(1, 0);
	int res=1e9;
	rep(i, 2, M-1) res=min(res, f[1][i]);
	cout<<res<<endl;
}

signed main(){
	solve();	
	return 0;
}