#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
int N, ans, arr[MAXN], smlFact[MAXN];
vector<int> edge[MAXN], fact[MAXN];
unordered_map<int, int> maxl[MAXN];
void cari(int now, int par) {
  for (auto i : edge[now]) {
    if (i == par) continue;
    cari(i, now);
  }
  unordered_map<int, priority_queue<int>> pq;
  for (auto f : fact[arr[now]]) {
    maxl[now][f] = 1;
  }
  int numChild = 0;
  for (auto i : edge[now]) {
    if (i == par) continue;
    numChild++;
    for (auto f : fact[arr[now]]) {
      maxl[now][f] = max(maxl[now][f], maxl[i][f] + 1);
      ans = max(ans, maxl[now][f]);
      pq[f].push(maxl[i][f]);
    }
  }
  if (numChild > 1) {
    for (auto f : fact[arr[now]]) {
      int x = pq[f].top();
      pq[f].pop();
      ans = max(ans, x + pq[f].top() + 1);
    }
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  memset(smlFact, -1, sizeof(smlFact));
  for (long long i = 2; i < MAXN; i++) {
    if (smlFact[i] != -1) continue;
    smlFact[i] = i;
    for (long long j = i * i; j < MAXN; j += i) {
      if (smlFact[j] == -1) smlFact[j] = i;
    }
  }
  cin >> N;
  bool satu = 1;
  for (int i = 1; i <= N; i++) {
    cin >> arr[i];
    satu &= arr[i] == 1;
    if (fact[arr[i]].empty()) {
      int now = arr[i];
      while (now > 1) {
        int procFact = smlFact[now];
        fact[arr[i]].push_back(procFact);
        while (now % procFact == 0) now /= procFact;
      }
    }
  }
  if (satu) {
    cout << "0\n";
    return 0;
  }
  for (int i = 1; i < N; i++) {
    int x, y;
    cin >> x >> y;
    edge[x].push_back(y);
    edge[y].push_back(x);
  }
  ans = 1;
  cari(1, -1);
  cout << ans << "\n";
}
