#include <bits/stdc++.h>

using namespace std;

const int N = 100005, P = 19;

int n, w[N], tree_size[N];

int sp[P][2 * N], LOG[2 * N];

vector<int> g[N];
vector<int> flat, tmp;
int st[N], ed[N];

int dfs(int u, int p) {
    st[u] = (int) flat.size();
    flat.push_back(w[u]);
    int ans = 1;
    for (int v : g[u])
        if (v != p)
            ans += dfs(v, u);
    ed[u] = (int) flat.size();
    flat.push_back(w[u]);
    return tree_size[u] = ans;
}

void build_sp() {
    for (int i = 0; i < flat.size(); ++i)
        sp[0][i] = flat[i];
    for (int i = 2; i <= flat.size(); ++i)
        LOG[i] = LOG[i / 2] + 1;
    for (int p = 1; p < P; ++p) {
        for (int i = 0; i + (1 << p) <= P; ++i) {
            int x = sp[p - 1][i];
            int y = sp[p - 1][i + (1 << (p - 1))];
            sp[p][i] = __gcd(x, y);
        }
    }
}

int query(int l, int r) {
    int p = LOG[r - l + 1];
    return __gcd(sp[p][l], sp[p][r - (1 << p) + 1]);
}

int main() {
    cin >> n;
    for (int i = 1; i <= n; ++i)
        cin >> w[i];
    for (int i = 1; i < n; ++i) {
        int u, v; cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    dfs(1, -1);
    build_sp();
    int ans = 0;
    for (int u = 1; u <= n; ++u)
        if (query(st[u], ed[u]) > 1)
            ans = max(ans, tree_size[u]);
    cout << ans << '\n';
    return 0;
}