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

const int MP = 100, MN = 5005, MA = 2*MN, INF = 0x3f3f3f3f;
inline bool ckmin(int &x, int v) { return x > v ? x = v, 1 : 0; }

int N, lf[MP]{1,1}, ar[MN], dp[MN][MP]; vector<int> primes, adjl[MN];

void dfs(int u) {
  for (int v: adjl[u]) {
    adjl[v].erase(find(adjl[v].begin(), adjl[v].end(), u));
    dfs(v);
  }
  for (int c = 2; c < MA; c++) {
    int cans = c == ar[u] ? 0 : c;
    for (int v: adjl[u]) {
      int s = INF;
      for (int p: primes)
        if (c%p == 0)
          ckmin(s, dp[v][p]);
      cans += s;
      if (cans >= INF) break;
    }
    for (int p: primes)
      if (c%p == 0)
        ckmin(dp[u][p], cans);
  }
  //printf("%d: ", u);
  //for (int i = 0; i < 5; i++)
  //  printf("(%d %d) ", primes[i], dp[u][primes[i]]);
  //printf("\n");
}

int main() {
  ios_base::sync_with_stdio(0); cin.tie(0);

  for (int i = 2; i < MP; i++) {
    if (!lf[i]) {
      primes.push_back(i);
      lf[i] = i;
    }
    for (int p: primes) {
      if (p * i >= MP || p > lf[i]) break;
      lf[p * i] = p;
    }
  }
  cin >> N;
  for (int i = 1; i <= N; i++)
    cin >> ar[i];  
  for (int i = 1, u, v; i < N; i++) {
    cin >> u >> v;
    adjl[u].push_back(v);
    adjl[v].push_back(u);
  }
  memset(dp, 0x3f, sizeof dp);
  dfs(1);
  printf("%d\n", *min_element(dp[1], dp[2]));

  return 0;
}