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

#ifdef DEBUG
#define fast
#else
#define fast cin.tie(0)->sync_with_stdio(0)
#define endl '\n'
#define cerr if(1);else cerr
#endif
#define _ <<' '<<
#define ALL(v) v.begin(),v.end()
#define ft first
#define sd second

using ll = long long;
using ld = long double;
using pii = pair<int,int>;

constexpr int MAXN = 1e5+5;

int fac[MAXN];
vector<int> prime{};

void build() {
	fac[0] = fac[1] = 1;
	for (int i = 2; i < MAXN; i++) {
		if (!fac[i]) {
			prime.emplace_back(i);
			fac[i] = i;
		}
		for (int p: prime) {
			if (i*p >= MAXN) break;
			fac[i*p] = p;
			if (i%p == 0) break;
		}	
	}
}

struct DSU {
	int mx;
	vector<int> ary;
	DSU(int n): mx(1), ary(n, -1) {}
	int find(int x) { return ary[x] < 0 ? x : ary[x] = find(ary[x]); }
	void merge(int u, int v) {
		u = find(u), v = find(v);
		if (u == v) return;
		if (-ary[u] < -ary[v])
			swap(u, v);
		ary[u] += ary[v];
		ary[v] = u;
		if (mx < -ary[u])
			mx = -ary[u];
	}
};

signed main() {
	fast;
	
	build();
	
	int n;
	cin >> n;
	vector<int> A(n);
	for (auto &x: A) cin >> x;
	vector<pii> edge(n-1);
	for (auto &[u,v]: edge) cin >> u >> v, u--, v--;
	
	map<int,vector<pii>> mp{};
	for (auto [u,v]: edge) {
		int g = __gcd(A[u], A[v]);
		vector<int> ps{};
		for (int x = g; x > 1; ) {
			int p = fac[x];
			ps.emplace_back(p);
			while (x % p == 0)
				x /= p;
		}
		for (auto p: ps)
			mp[p].emplace_back(u, v);
	}
	
	int ans = 0;
	DSU dsu(n);
	for (auto &[p,E]: mp) {
		for (auto [u,v]: E)
			dsu.merge(u, v);
		ans = max(ans, dsu.mx);
		dsu.mx = 1;
		for (auto [u,v]: E)
			dsu.ary[u] = dsu.ary[v] = -1;
	}
	cout << ans << endl;
	
	return 0;
}