#include <bits/stdc++.h>
using namespace std;
template <typename T>
void maxtt(T &t1, T t2) {
  t1 = max(t1, t2);
}
template <typename T>
void mintt(T &t1, T t2) {
  t1 = min(t1, t2);
}
bool debug = 0;
int n, m, k;
string direc = "URDL";
const long long MOD2 = (long long)1000000007 * (long long)1000000007;
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int &x, int y, int mod = 1000000007) {
  assert(y >= 0);
  x += y;
  if (x >= mod) x -= mod;
  assert(x >= 0 && x < mod);
}
void et(int x = -1) {
  printf("%d\n", x);
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 1000000007) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; }
vector<int> mp[100035];
long long X[100035];
int d[100035];
void dfs(int x, int pa) {
  d[x] = d[pa] + 1;
  for (int c : mp[x])
    if (c != pa) {
      dfs(c, x);
    }
}
int Ans;
inline void dfs1(int x, int pa, vector<pair<int, long long>> &vp) {
  assert(vp.size() < 50);
  int cd = d[x];
  for (auto &p : vp) {
    addmod(Ans, p.second * (cd - d[p.first]) % 1000000007);
    cd = d[p.first];
  }
  for (int c : mp[x])
    if (c != pa) {
      vector<pair<int, long long>> tmp;
      tmp.push_back({x, X[c]});
      for (auto &p : vp) {
        long long z = tmp.back().second;
        long long y = gcd1(z, p.second);
        if (y == z) {
          tmp[tmp.size() - 1].first = p.first;
        } else {
          tmp.push_back({p.first, y});
        }
      }
      dfs1(c, x, tmp);
    }
}
void fmain(int tid) {
  scanf("%d", &n);
  for (int(i) = 1; (i) <= (int)(n); (i)++) scanf("%lld", X + i);
  for (int i = 0, u, v; i < n - 1; i++) {
    scanf("%d%d", &u, &v);
    mp[u].push_back(v);
    mp[v].push_back(u);
  };
  dfs(1, 0);
  vector<pair<int, long long>> tmp;
  tmp.push_back({0, X[1]});
  dfs1(1, 0, tmp);
  printf("%d\n", Ans);
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
