#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

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

#define ll long long
#define ld long double


const int N = 1e6 + 1, mod = 1e9 + 7;
int n, a[N];
bool prime[N];
vector<int> d[N], g[N];
map<pair<int, int>, int> dp;
int dfs(int node, int par, int gcd) {
    if(gcd != N && a[node] % gcd)
        return dp[{node, gcd}] = 0;
    if(dp.count({node, gcd}))
        return dp[{node, gcd}];
    int &ans = dp[{node, gcd}];
    if(gcd == N) {
        for(auto i : g[node]) {
            if(i == par)
                continue;
            ans = max(ans, dfs(i, node, N));
        }
        for(auto j : d[a[node]]) {
            int cnt = 1;
            for(auto i : g[node]) {
                if(i == par)
                    continue;
                cnt += dfs(i, node, j);
            }
            ans = max(ans, cnt);
        }
    } else {
        ans = 1;
        for(auto i : g[node]) {
            if(i == par)
                continue;
            ans += dfs(i, node, gcd);
        }
    }
    return ans;
}
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    memset(prime, true, sizeof prime);
    for(int i = 2;i < N;i++) {
        if(!prime[i])
            continue;
        for(int j = i;j < N;j += i) {
            prime[j] = false;
            d[j].push_back(i);
        }
    }
    cin >> n;
    for(int i = 1;i <= n;i++)
        cin >> a[i];
    for(int i = 1;i < n;i++) {
        int u, v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    cout << dfs(1, 1, N);
    return 0;
}