Problem: Tired of boring dates, Leha and Noora decided to play a game.

Leha found a tree with n vertices numbered from 1 to n. We remind you that tree is an undirected graph without cycles. Each vertex v of a tree has a number av written on it. Quite by accident it turned out that all values written on vertices are distinct and are natural numbers between 1 and n.

The game goes in the following way. Noora chooses some vertex u of a tree uniformly at random and passes a move to Leha. Leha, in his turn, chooses (also uniformly at random) some vertex v from remaining vertices of a tree (v ≠ u). As you could guess there are n(n - 1) variants of choosing vertices by players. After that players calculate the value of a function f(u, v) = φ(au·av) · d(u, v) of the chosen vertices where φ(x) is Euler's totient function and d(x, y) is the shortest distance between vertices x and y in a tree.

Soon the game became boring for Noora, so Leha decided to defuse the situation and calculate expected value of function f over all variants of choosing vertices u and v, hoping of at least somehow surprise the girl.

Leha asks for your help in calculating this expected value. Let this value be representable in the form of an irreducible fraction <image>. To further surprise Noora, he wants to name her the value <image>. 

Help Leha!

Input

The first line of input contains one integer number n (2 ≤ n ≤ 2·105) — number of vertices in a tree.

The second line contains n different numbers a1, a2, ..., an (1 ≤ ai ≤ n) separated by spaces, denoting the values written on a tree vertices.

Each of the next n - 1 lines contains two integer numbers x and y (1 ≤ x, y ≤ n), describing the next edge of a tree. It is guaranteed that this set of edges describes a tree.

Output

In a single line print a number equal to P·Q - 1 modulo 109 + 7.

Examples

Input

3
1 2 3
1 2
2 3


Output

333333338


Input

5
5 4 3 1 2
3 5
1 2
4 3
2 5


Output

8

Note

Euler's totient function φ(n) is the number of such i that 1 ≤ i ≤ n,and gcd(i, n) = 1, where gcd(x, y) is the greatest common divisor of numbers x and y.

There are 6 variants of choosing vertices by Leha and Noora in the first testcase:

  * u = 1, v = 2, f(1, 2) = φ(a1·a2)·d(1, 2) = φ(1·2)·1 = φ(2) = 1
  * u = 2, v = 1, f(2, 1) = f(1, 2) = 1
  * u = 1, v = 3, f(1, 3) = φ(a1·a3)·d(1, 3) = φ(1·3)·2 = 2φ(3) = 4
  * u = 3, v = 1, f(3, 1) = f(1, 3) = 4
  * u = 2, v = 3, f(2, 3) = φ(a2·a3)·d(2, 3) = φ(2·3)·1 = φ(6) = 2
  * u = 3, v = 2, f(3, 2) = f(2, 3) = 2



Expected value equals to <image>. The value Leha wants to name Noora is 7·3 - 1 = 7·333333336 = 333333338 <image>.

In the second testcase expected value equals to <image>, so Leha will have to surprise Hoora by number 8·1 - 1 = 8 <image>.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "inline")
using std::swap;
using std::vector;
inline int back2(vector<int> &V) { return V[(int)V.size() - 2]; }
const int mod = 1e9 + 7;
inline int add(int a, int b) { return (a += b) >= mod ? a - mod : a; }
inline int sub(int a, int b) { return (a -= b) < 0 ? a + mod : a; }
inline int mul(int a, int b) { return (long long)a * b % mod; }
inline int qpow(int a, int b) {
  int res = 1;
  for (; b; a = mul(a, a), b >>= 1)
    if (b & 1) res = mul(res, a);
  return res;
}
const int N = 2e5 + 5;
int prime[N], tot;
int mu[N], phi[N];
bool isprime[N];
inline void sieve(int n) {
  register int i, j;
  memset(isprime + 1, 1, sizeof(bool) * n);
  isprime[1] = 0;
  mu[1] = phi[1] = 1;
  for (i = 1; i <= n; i++) {
    if (isprime[i]) prime[++tot] = i, mu[i] = sub(0, 1), phi[i] = sub(i, 1);
    for (j = 1; j <= tot && i * prime[j] <= n; j++) {
      isprime[i * prime[j]] = 0;
      if (i % prime[j] == 0) {
        phi[i * prime[j]] = mul(phi[i], prime[j]);
        break;
      }
      mu[i * prime[j]] = sub(0, mu[i]);
      phi[i * prime[j]] = mul(phi[i], phi[prime[j]]);
    }
  }
  return;
}
int n, idx;
int a[N], F[N], f[N], c[N];
int v[N << 1], first[N], next[N << 1];
int id[N], father[N], hson[N], deep[N], size[N], top[N];
vector<int> V[N];
vector<int> S;
void dfs1(int now) {
  register int go;
  deep[now] = deep[father[now]] + 1;
  size[now] = 1;
  for (go = first[now]; go; go = next[go])
    if (v[go] != father[now]) {
      father[v[go]] = now;
      dfs1(v[go]);
      size[now] += size[v[go]];
      if (size[v[go]] > size[hson[now]]) hson[now] = v[go];
    }
  return;
}
void dfs2(int now, int root) {
  register int go;
  id[now] = ++idx;
  top[now] = root;
  if (hson[now]) dfs2(hson[now], root);
  for (go = first[now]; go; go = next[go])
    if (v[go] != father[now] && v[go] != hson[now]) dfs2(v[go], v[go]);
  return;
}
inline int lca(int x, int y) {
  while (top[x] != top[y]) {
    if (deep[top[x]] < deep[top[y]]) swap(x, y);
    x = father[top[x]];
  }
  if (deep[x] < deep[y]) swap(x, y);
  return y;
}
vector<int> st;
struct edge {
  int v, w;
  edge(int _v = 0, int _w = 0) {
    v = _v;
    w = _w;
    return;
  }
};
vector<edge> ch[N];
inline void build_tree() {
  int x, y;
  register int i;
  st.clear();
  st.push_back(S[0]);
  for (i = 1; i < (int)S.size(); i++) {
    x = S[i];
    y = lca(st.back(), x);
    while ((int)st.size() > 1 && deep[back2(st)] > deep[y])
      ch[back2(st)].push_back(
          edge(st.back(), deep[st.back()] - deep[back2(st)])),
          st.pop_back();
    if (deep[st.back()] > deep[y])
      ch[y].push_back(edge(st.back(), deep[st.back()] - deep[y])),
          st.pop_back();
    if (st.empty() || st.back() != y) st.push_back(y);
    if (st.back() != x) st.push_back(x);
  }
  while ((int)st.size() > 1)
    ch[back2(st)].push_back(edge(st.back(), deep[st.back()] - deep[back2(st)])),
        st.pop_back();
  return;
}
int res;
int wa[N], wa2[N];
void dfs(int now) {
  register int i;
  wa[now] = phi[a[now]] * c[now];
  wa2[now] = 0;
  for (i = 0; i < (int)ch[now].size(); i++) {
    dfs(ch[now][i].v);
    wa2[ch[now][i].v] =
        add(wa2[ch[now][i].v], mul(ch[now][i].w, wa[ch[now][i].v]));
    res = add(res, add(mul(wa[now], wa2[ch[now][i].v]),
                       mul(wa2[now], wa[ch[now][i].v])));
    wa[now] = add(wa[now], wa[ch[now][i].v]);
    wa2[now] = add(wa2[now], wa2[ch[now][i].v]);
  }
  ch[now].clear();
  return;
}
signed main() {
  register int i, j;
  scanf("%d", &n);
  sieve(n);
  for (i = 1; i <= n; i++) scanf("%d", &a[i]), V[a[i]].push_back(i);
  for (i = 1; i <= n - 1; i++) {
    scanf("%d%d", &v[i + n - 1], &v[i]);
    next[i] = first[v[i + n - 1]];
    first[v[i + n - 1]] = i;
    next[i + n - 1] = first[v[i]];
    first[v[i]] = i + n - 1;
  }
  dfs1(1);
  dfs2(1, 1);
  for (i = 1; i <= n; i++) {
    S.clear();
    for (j = i; j <= n; j += i) S.insert(S.end(), V[j].begin(), V[j].end());
    sort(S.begin(), S.end(),
         [&](int x, int y) -> bool { return id[x] < id[y]; });
    for (j = 0; j < (int)S.size(); j++) c[S[j]] = 1;
    build_tree();
    res = 0;
    dfs(st[0]);
    F[i] = res;
    for (j = 0; j < (int)S.size(); j++) c[S[j]] = 0;
  }
  for (i = 1; i <= n; i++)
    for (j = 1; i * j <= n; j++) f[i] = add(f[i], mul(mu[j], F[i * j]));
  int ans = 0;
  for (i = 1; i <= n; i++)
    ans = add(ans, mul(mul(i, qpow(phi[i], mod - 2)), f[i]));
  ans = mul(2, ans);
  ans = mul(ans, qpow(mul(n, n - 1), mod - 2));
  printf("%d\n", ans);
  return 0;
}