#include <bits/stdc++.h>
using namespace std;

#define forn(i,a,b) for(int i = a; i < (b); i++)
#define fore(i,a,b) for(int i = a; i <= (b); i++)
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using ll = long long;
using ld = long double;

static constexpr ll kInf = 1'000'000'000'000'000'000;
static constexpr int kMaxA = 100;

void dfs(const vector<vector<int>> &adj, const vector<int>& a,
         vector<vector<ll>>& dp, const int u, const int p)
{
    for (int v : adj[u])
    {
        if (v == p) continue;
        dfs(adj, a, dp, v, u);
    }

    for (int j = 1; j <= kMaxA; j++)
    {
        ll sum = j;
        if (j == a[u]) sum = 0;  // no change needed
        for (int v : adj[u])
        {
            if (v == p) continue;

            ll mn = kInf;
            for (int k = 1; k <= kMaxA; k++)
            {
                if (gcd(k, j) == 1) continue;
                mn = min(mn, dp[v][k]);
            }
            sum += mn;
        }
        dp[u][j] = sum;
    }
}

int main()
{
    cin.tie(0)->sync_with_stdio(0);

    int n; cin>>n;
    vector<int> a(n);
    forn(i,0,n) cin>>a[i];

    vector<vector<int>> adj(n);
    forn(i,0,n-1)
    {
        int u,v; cin>>u>>v; u--; v--;
        adj[u].pb(v);
        adj[v].pb(u);
    }

    vector<vector<ll>> dp(n, vector<ll>(kMaxA + 1, 0));
    dfs(adj, a, dp, 0, -1);
    
    ll ans = kInf;
    fore(i, 1, kMaxA) ans = min(ans, dp[0][i]);
    cout << ans << '\n';
}