#include <bits/stdc++.h>
using namespace std;
#define MAX 1010101
vector<int> lst[MAX];
int A[MAX];
int p[MAX];
int num[MAX];
vector<int> adj[MAX];
int chk[MAX];
int mx=1;
int find(int x) {
	if(p[x] == x) return x;
	return p[x] = find(p[x]);
}
void uni(int a, int b) {
	a = find(a);
	b = find(b);
	if(a == b) return;
	p[a] = b;
	num[b]+=num[a];
	mx = max(mx, num[b]);
}
void calc(vector<int> &arr){
	for(auto v:arr) {
		for(auto u:adj[v]) {
			if(chk[u]) uni(u, v);
		}
		chk[v] = 1;
	}
	for(auto v:arr) chk[v]=0;
}
signed main(){
	ios::sync_with_stdio(false), cin.tie(0);
	int N;
	cin>>N;
	int i, j;
	int amx=0;
	for(i=1;i<=N;i++) {
		cin>>A[i];
		amx = max(amx, A[i]);
		for(j=2;j*j<=A[i];j++) {
			if(A[i]%j) continue;
			lst[j].push_back(i);
			while(A[i]%j==0) A[i]/=j;
		}
		if(A[i]>1) lst[A[i]].push_back(i);
	}
	int a, b;
	for(i=1;i<N;i++) {
		cin>>a>>b;
		adj[a].push_back(b);
		adj[b].push_back(a);
	}
	if(amx == 1){
		cout<<0;
		return 0;
	}
	for(i=2;i<MAX;i++) {
		if(lst[i].size()) {
			for(j=1;j<=N;j++) p[j] = j, num[j] = 1;
			calc(lst[i]);
		}
	}
	cout<<mx;
}