#include <bits/stdc++.h>
using namespace std;
static inline void canhazfast() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
}
template <typename T>
T gcd(T a, T b) {
  return b == 0 ? a : gcd(b, a % b);
}
template <typename T>
T extgcd(T a, T b, T &x, T &y) {
  T x0 = 1, y0 = 0, x1 = 0, y1 = 1;
  while (b) {
    T q = a / b;
    a %= b;
    swap(a, b);
    x0 -= q * x1;
    swap(x0, x1);
    y0 -= q * y1;
    swap(y0, y1);
  }
  x = x0;
  y = y0;
  return a;
}
static inline int ctz(unsigned x) { return __builtin_ctz(x); }
static inline int ctzll(unsigned long long x) { return __builtin_ctzll(x); }
static inline int clz(unsigned x) { return __builtin_clz(x); }
static inline int clzll(unsigned long long x) { return __builtin_clzll(x); }
static inline int popcnt(unsigned x) { return __builtin_popcount(x); }
static inline int popcntll(unsigned long long x) {
  return __builtin_popcountll(x);
}
static inline int bsr(unsigned x) { return 31 ^ clz(x); }
static inline int bsrll(unsigned long long x) { return 63 ^ clzll(x); }
unsigned a[200008];
long long ans[200008];
vector<int> adj[200008];
map<unsigned, long long> cnt[200008];
void dfs(int u, int p = 0) {
  for (int v : adj[u]) {
    if (v == p) continue;
    dfs(v, u);
    for (auto &cv : cnt[v]) {
      for (auto &cu : cnt[u]) {
        ans[gcd(cv.first, cu.first)] += cv.second * cu.second;
      }
    }
    for (auto &cv : cnt[v]) cnt[u][gcd(a[u], cv.first)] += cv.second;
    cnt[v].clear();
  }
  ++cnt[u][a[u]];
  for (auto cu : cnt[u]) ans[cu.first] += cu.second;
}
int main() {
  canhazfast();
  int n;
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  for (int i = 1; i < n; ++i) {
    int x, y;
    cin >> x >> y;
    adj[x].push_back(y);
    adj[y].push_back(x);
  }
  dfs(1);
  for (int i = 1; i <= 200000; ++i)
    if (ans[i]) cout << i << ' ' << ans[i] << '\n';
  return 0;
}
