#include<bits/stdc++.h>

using namespace std;

typedef pair<int, int> pi;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define mp make_pair
#define rsz resize
#define pb push_back

int n, m = 101;
vector<int> val;
vector<vector<int>> dp, best, adj;

void dfs(int i, int p) {
    for (int nb : adj[i]) if (nb != p) dfs(nb, i);
    FOR(j, 1, m) {
        if (j == val[i]) dp[i][j] = 0;
        else dp[i][j] = j;
        for (int nb : adj[i]) if (nb != p) {
            int cur = 2*n;
            FOR(k, 2, 101) if (j%k==0) cur = min(cur, best[nb][k]);
            dp[i][j] += cur;
        }
        FOR(k, 2, 101) if (j%k==0) best[i][k] = min(best[i][k], dp[i][j]);
        // cout << i << ' ' << j << ' ' << dp[i][j] << '\n';
    }
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    m = max(101, 2*n);
    val.rsz(n);
    F0R(i, n) cin >> val[i];
    adj.rsz(n);
    F0R(i, n-1) {
        int a,b; cin >> a >> b; a--; b--;
        adj[a].pb(b); adj[b].pb(a);
    }
    dp.assign(n, vector<int>(m, 1e9));
    best.assign(n, vector<int>(101, 1e9));
    dfs(0,0);
    int ans = m;
    F0R(j, 2*n) ans = min(ans, dp[0][j]);
    cout << ans << '\n';
}