#include<bits/stdc++.h>
#define For(i,n) for(int i=1;i<=n;++i)
#define maxn 5005
#define fi first
#define se second
#define inf 2000000000
#define lnf 2000000000000000000
#define _ push_back
#define ll long long
#define II pair<int,int>
#define III pair<II,int>
#define ve vector<int>
#define task 

using namespace std;

int dp[maxn][1400];
vector<int> adj[maxn];
int a[maxn];
int n;
vector<int> divi;
int e[maxn];
vector<int> snt;
vector<int> ntcn[26];
void dfs(int u, int dad) {
	for(int v:adj[u]) if(v!=dad) {
		dfs(v,u);
	}	
	for(int i=0;i<divi.size();++i) if(a[u]!=divi[i]) dp[u][i]=divi[i];
	for(int v:adj[u]) if(v!=dad){
		for(int i=0;i<snt.size();++i) {
			int kq=2*n;
			for(int j=0;j<ntcn[i].size();++j) {
				kq=min(kq,dp[v][ntcn[i][j]]);
			}
			for(int j=0;j<ntcn[i].size();++j) {
				dp[u][ntcn[i][j]] += kq;
			}
		}		
	}
}

void inp(){
	cin >> n;
	For(i,n)
		cin >> a[i];
	for(int i=1;i<n;++i) {
		int u, v;
		cin >> u >> v;
		adj[u]._(v);
		adj[v]._(u);
	}
}

void outp(){
	for(int i=1;i<=100;++i) {
		e[i]=i;
	}
	for(int i=2;i*i<=100;++i)
		if(e[i]==i)
			for(int j=i+i;j<=100;j+=i)
				e[j]=i;
	for(int i=2;i<=100;++i) if(e[i]==i) snt._(i);
	for(int i=2;i<=10000;++i) {
		int y=i;
		for(int x : snt) {
			if(y%x==0) y/=x;
		}
		if(y==1) divi._(i);
	}
	for(int i=1;i<=n;++i) {
		int y=a[i];
		int kw=1;
		while(y>1) {
			int p=e[y];
			while(y%p==0) y/=p;
			kw*=p;
		}
		a[i]=kw;
	}
	int kq=2*n;
	for(int i=0;i<snt.size();++i) {
		for(int j=0;j<divi.size();++j) if(divi[j]%snt[i]==0) ntcn[i]._(j);
	}
	dfs(1,0);
	for(int i=0;i<divi.size();++i) kq=min(kq,dp[1][i]);
	cout << kq;
}

int main(){
	if(fopen(task".inp","r")) {
		freopen(task".inp","r",stdin);
		freopen(task".out","w",stdout);
	}
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	inp();
	outp();
}