#include <bits/stdc++.h>
#define pii pair<int, int>
#define x first
#define y second
#define N 5005
using namespace std;
int n, dp[N][105], arr[N];
vector<int> g[N];
vector<int> factor[105];
void dfs(int p, int lp){
    for (int i = 2; i <= 100; i++)
        dp[p][i] = i;
    dp[p][arr[p]] = 0;
    for (auto u : g[p]){
        if (u != lp){
            dfs(u, p);
            for (int i = 2; i <= 100; i++){
                int mn = 1e9;
                for (int j = i; j <= 100; j += i)
                    mn = min(mn, dp[u][j]);
                for (auto j : factor[i])
                    mn = min(mn, dp[u][j]);
                dp[p][i] += mn;
            }
        }
    }
}
int main(){
    for (int i = 2; i <= 100; i++)
        for (int j = i; j <= 100; j += i)
            factor[j].push_back(i);
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> arr[i];
    for (int i = 1; i < n; i++){
        int a, b; cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    dfs(1, 0);
    int ans = 1e9;
    for (int i = 2; i <= 100; i++)
        ans = min(ans, dp[1][i]);
    cout << ans << '\n';
    return 0;
}