//#pragma GCC optimize(3)

//#pragma comment(linker, "/STACK:102400000,102400000")  //c++

// #pragma GCC diagnostic error "-std=c++11"

// #pragma comment(linker, "/stack:200000000")

// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <algorithm>

#include  <iterator>

#include  <iostream>

#include   <cstring>

#include   <cstdlib>

#include   <iomanip>

#include    <bitset>

#include    <cctype>

#include    <cstdio>

#include    <string>

#include    <vector>

#include     <stack>

#include     <cmath>

#include     <queue>

#include      <list>

#include       <map>

#include       <set>

#include   <cassert>

using namespace std;

#define lson (l , mid , rt << 1)

#define rson (mid + 1 , r , rt << 1 | 1)

#define debug(x) cerr << #x << " = " << x << "\n";

#define pb push_back

#define pq priority_queue

typedef long long ll;

typedef unsigned long long ull;

//typedef __int128 bll;

typedef pair<ll ,ll > pll;

typedef pair<int ,int > pii;

typedef pair<int,pii> p3;

//priority_queue<int> q;//这是一个大根堆q

//priority_queue<int,vector<int>,greater<int> >q;//这是一个小根堆q

#define fi first

#define se second

//#define endl '\n'

#define OKC ios::sync_with_stdio(false);cin.tie(0)

#define FT(A,B,C) for(int A=B;A <= C;++A)  //用来压行

#define REP(i , j , k)  for(int i = j ; i <  k ; ++i)

#define max3(a,b,c) max(max(a,b), c);

#define min3(a,b,c) min(min(a,b), c);

//priority_queue<int ,vector<int>, greater<int> >que;

const ll mos = 0x7FFFFFFF;  //

const ll nmos = 0x80000000;  //-2147483648

const int inf = 0x3f3f3f3f;

const ll inff = 0x3f3f3f3f3f3f3f3f; //18

// const int mod = 998244353;

const double esp = 1e-;

const double PI=acos(-1.0);

const double PHI=0.61803399;    //黄金分割点

const double tPHI=0.38196601;

template<typename T>

inline T read(T&x){

    x=;int f=;char ch=getchar();

    while (ch<''||ch>'') f|=(ch=='-'),ch=getchar();

    while (ch>=''&&ch<='') x=x*+ch-'',ch=getchar();

    return x=f?-x:x;

}

/*-----------------------showtime----------------------*/

            const int maxn = 2e5+;

            int a[maxn];

            vector<int>mp[maxn];

            int vis[maxn];

            int dp[maxn];

            int ans = ;

            vector<int>p[maxn],t[maxn];

            void dfs(int u, int fa){

                for(int i=; i<mp[u].size(); i++){

                    int v = mp[u][i];

                    if(v == fa)continue;

                    dfs(v,u);

                    for(int j=; j<p[u].size(); j++){

                        for(int k=; k<p[v].size(); k++){

                            if(p[u][j] == p[v][k]){

                                ans = max(ans, t[u][j] + t[v][k]);

                                t[u][j] = max(t[u][j], t[v][k] + );

                            }

                        }

                    }

                }

                if(a[u] > ) ans = max(ans, );

            }

int main(){

            int n;  scanf("%d", &n);

            int flag = ;

            for(int i=; i<=n; i++) {

                scanf("%d", &a[i]);

                int x = a[i];

                for(ll j=; j*j <=x; j++){

                    if(x%j == ){

                        p[i].pb(j);

                        t[i].pb();

                        while(x%j==) x/=j;

                    }

                }

                if(x > ){

                    p[i].pb(x);

                    t[i].pb();

                }

                if(a[i] > ) flag = ;

            }

            if(flag) {

                puts("");

                return ;

            }

            for(int i=; i<n; i++){

                int u,v;

                scanf("%d%d", &u, &v);

                mp[u].pb(v);

                mp[v].pb(u);

            }

            dfs(,-);

            printf("%d\n", ans);

            return ;

}