The first line of the input will contain $N$ (1 &le; $N$ &le; 100000), the number of nodes. The second line will contain $N$ numbers, the $i-th$ number, representing the <tex>value_i</tex> (1 &le; <tex>value_i</tex> &le; 30000). Each of the next $N - 1$ lines will contain a pair of nodes $(u, v)$, each representing an edge of the tree.

For tests worth $20$ points (1 ≤ $N$ ≤ 1000)
For tests worth $20$ more points, <tex> value[i] = value[1] </tex> for $i = 1, 2,...n$
 

h2. Date de ieşire
The output will contain the sum of costs over all pairs of nodes $(u, v)$, such that $gcd(value[u], value[v]) > 1$

h2. Restricţii
 
For the first subtask (1 ≤ $N$ ≤ 1000)
For the second subtask, <tex> value[i] = value[1] </tex> for $i = 1, 2,...n$
 

h2. Exemplu