#include<bits/stdc++.h>
using namespace std;
int n,mi[5050][25],v[5050];
vector<int> pr,num,edge[5050];
void dfs(int fa,int x){
    for (int i=0;i<edge[x].size();i++)
    if (edge[x][i]!=fa) dfs(x,edge[x][i]);
    num.push_back(v[x]);
    for (int i=0;i<num.size();i++){
        int tmp=0;
        if (num[i]!=v[x]) tmp=num[i];
        for (int j=0;j<edge[x].size();j++)
        if (edge[x][j]!=fa){
            int now_mi=100000;
            for (int k=0;k<pr.size();k++)
            if (num[i]%pr[k]==0) now_mi=min(now_mi,mi[edge[x][j]][k]);
            tmp+=now_mi;
        }
        for (int j=0;j<pr.size();j++)
        if (num[i]%pr[j]==0) mi[x][j]=min(mi[x][j],tmp);
    }
    num.pop_back();
}
int main(){
    for (int i=2;i<=100;i++){
        int f=1;
        for (int j=2;j*j<=i;j++)
        if (i%j==0) f=0;
        if (f==1) pr.push_back(i);
    }
    for (int i=2;i<=10000;i++){
        int tmp=i;
        for (int j=0;j<pr.size();j++)
        if (tmp%pr[j]==0){
            tmp/=pr[j];
        }
        if (tmp==1) num.push_back(i);
    }
    memset(mi,0x7f,sizeof(mi));
    scanf("%d",&n);
    for (int i=1;i<=n;i++) scanf("%d",&v[i]);
    for (int i=1;i<n;i++){
        int o,p;
        scanf("%d%d",&o,&p);
        edge[o].push_back(p);
        edge[p].push_back(o);
    }
    for (int i=2;i<=100;i++) dfs(0,1);
    int res=1000000;
    for (int i=0;i<pr.size();i++) res=min(res,mi[1][i]);
    printf("%d\n",res);
}