#include <iostream>
#include <vector>
using namespace std ;
vector<vector<int>> edges ;
vector<int> val, done ;
int n, maxval ;
int primes[] =
    {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97} ;
int gcd(int a, int b) {
   if (b < a)
      swap(a, b) ;
   if (a == 0)
      return b ;
   return gcd(b % a, a) ;
}
vector<int> recur(int a) {
   done[a] = 1 ;
   vector<int> r(maxval) ;
   for (int i=2; i<maxval; i++)
      r[i] = (val[a] == i ? 0 : i) ;
   for (int b: edges[a])
      if (!done[b]) {
         auto r2 = recur(b) ;
         for (int pi=0; pi<25; pi++) {
            int p = primes[pi] ;
            int mv = 1000000000 ;
            for (int m=p; m<maxval; m += p)
               mv = min(mv, r2[m]) ;
            r2[p] = mv ;
         }
         for (int pi=0; pi<25; pi++) {
            int p = primes[pi] ;
            int mv = r2[p] ;
            for (int m=2*p; m<maxval; m += p)
               r2[m] = min(mv, r2[m]) ;
         }
         for (int i=2; i<maxval; i++)
            r[i] += r2[i] ;
      }
   return r ;
}
int main() {
   cin >> n ;
   val.resize(n) ;
   edges.resize(n) ;
   done.resize(n) ;
   vector<int> v ;
   for (auto &v: val)
      cin >> v ;
   for (int i=1; i<n; i++) {
      int a, b ;
      cin >> a >> b ;
      a-- ;
      b-- ;
      edges[a].push_back(b) ;
      edges[b].push_back(a) ;
   }
   int root = (int)(n*drand48()) ;
   maxval = max(101, 2 * n + 1) ;
   auto rv = recur(root) ;
   int r = rv[2] ;
   for (int i=3; i<maxval; i++)
      r = min(r, rv[i]) ;
   cout << r << endl ;
}