#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
bool dbg = 0;
clock_t start_time = clock();
void bad(string mes = "Impossible") {
  cout << mes;
  exit(0);
}
void bad(int mes) {
  cout << mes;
  exit(0);
}
template <typename T>
string bin(T x, int st = 2) {
  string ans = "";
  while (x > 0) {
    ans += char('0' + x % st);
    x /= st;
  }
  reverse(ans.begin(), ans.end());
  return ans.empty() ? "0" : ans;
}
template <typename T>
void upmax(T& x, T y) {
  x = max(x, y);
}
template <typename T>
void upmin(T& x, T y) {
  x = min(x, y);
}
template <typename T>
T input() {
  T ans = 0, m = 1;
  char c = ' ';
  while (!((c >= '0' && c <= '9') || c == '-')) {
    c = getchar();
  }
  if (c == '-') m = -1, c = getchar();
  while (c >= '0' && c <= '9') {
    ans = ans * 10 + (c - '0'), c = getchar();
  }
  return ans * m;
}
template <typename T>
void read(T& a) {
  a = input<T>();
}
template <typename T>
void read(T& a, T& b) {
  read(a), read(b);
}
template <typename T>
void read(T& a, T& b, T& c) {
  read(a, b), read(c);
}
template <typename T>
void read(T& a, T& b, T& c, T& d) {
  read(a, b), read(c, d);
}
const int inf = 1e9 + 20;
const short short_inf = 3e4 + 20;
const long double eps = 1e-6;
const int maxn = (int)1e5 + 12;
const long long llinf = 2e18 + 5;
const double PI = acos(-1.0);
const int mod = 1e9 + 7;
template <typename T>
T binpow(T n, T second) {
  if (second <= 0) return 1LL;
  if (second % 2 == 0) {
    T b = binpow(n, second / 2);
    return (1LL * b * b) % mod;
  } else {
    return (1LL * binpow(n, second - 1) * n) % mod;
  }
}
long long x[maxn];
vector<pair<long long, int>> rng[maxn];
vector<pair<long long, int>> tmp;
vector<int> g[maxn];
long long ans = 0;
long long gc(long long a, long long b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a + b;
}
void dfs(int v, int p = -1) {
  if (v == 0) {
    rng[v].push_back({x[v], 1});
  } else {
    rng[v] = rng[p];
    rng[v].push_back({x[v], 1});
    for (int i = 0; i < rng[v].size(); i++) {
      rng[v][i].first = gc(rng[v][i].first, x[v]);
    }
    tmp.clear();
    for (int i = 0; i < rng[v].size(); i++) {
      if (tmp.empty() || tmp.back().first != rng[v][i].first) {
        tmp.push_back(rng[v][i]);
      } else {
        tmp.back().second += rng[v][i].second;
      }
    }
    rng[v] = tmp;
  }
  for (int i = 0; i < rng[v].size(); i++) {
    ans += rng[v][i].first * rng[v][i].second % mod;
    if (ans >= mod) ans -= mod;
  }
  for (auto to : g[v]) {
    if (to == p) continue;
    dfs(to, v);
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> x[i];
  }
  for (int i = 0; i + 1 < n; i++) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  dfs(0);
  cout << ans;
  return 0;
}
