Problem: Let the main characters of this problem be personages from some recent movie. New Avengers seem to make a lot of buzz. I didn't watch any part of the franchise and don't know its heroes well, but it won't stop me from using them in this problem statement. So, Thanos and Dr. Strange are doing their superhero and supervillain stuff, but then suddenly they stumble across a regular competitive programming problem.

You are given a tree with n vertices.

In each vertex v there is positive integer a_{v}.

You have to answer q queries.

Each query has a from u v x.

You have to calculate ∏_{w ∈ P} gcd(x, a_{w}) mod (10^{9} + 7), where P is a set of vertices on path from u to v. In other words, you are to calculate the product of gcd(x, a_{w}) for all vertices w on the path from u to v. As it might be large, compute it modulo 10^9+7. Here gcd(s, t) denotes the greatest common divisor of s and t.

Note that the numbers in vertices do not change after queries.

I suppose that you are more interested in superhero business of Thanos and Dr. Strange than in them solving the problem. So you are invited to solve this problem instead of them.

Input

In the first line of input there is one integer n (1 ≤ n ≤ 10^{5}) — the size of the tree.

In the next n-1 lines the edges of the tree are described. The i-th edge is described with two integers u_{i} and v_{i} (1 ≤ u_{i}, v_{i} ≤ n) and it connects the vertices u_{i} and v_{i}. It is guaranteed that graph with these edges is a tree.

In the next line there are n integers a_1, a_2, …, a_n (1 ≤ a_{v} ≤ 10^{7}).

In the next line there is one integer q (1 ≤ q ≤ 10^{5}) — the number of queries.

And in the next q lines the queries are described. Each query is described with three integers u_{i}, v_{i} and x_{i} (1 ≤ u_{i}, v_{i} ≤ n, 1 ≤ x_{i} ≤ 10^{7}).

Output

Print q numbers — the answers to the queries in the order they are given in the input. Print each answer modulo 10^9+7 = 1000000007. Print each number on a separate line.

Examples

Input

4
1 2
1 3
1 4
6 4 9 5
3
2 3 6
2 3 2
3 4 7


Output

36
4
1


Input

6
1 2
2 3
2 4
1 5
5 6
100000 200000 500000 40000 800000 250000
3
3 5 10000000
6 2 3500000
4 1 64000


Output

196000
12250
999998215

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
vector<int> primes;
vector<int> smallestPrimeFactor;
void linearSieve(int n) {
  if (n < 1) n = 1;
  if ((int)smallestPrimeFactor.size() >= n + 1) return;
  int primePiBound = n < 20 ? n - 1 : (int)(n / (log(n * 1.) - 2) + 2);
  primes.assign(primePiBound + 1, numeric_limits<int>::max());
  int P = 0;
  smallestPrimeFactor.assign(n + 1, 0);
  smallestPrimeFactor[1] = 1;
  int n2 = n / 2, n3 = n / 3, n5 = n / 5;
  if (n >= 2) primes[P++] = 2;
  if (n >= 3) primes[P++] = 3;
  for (int q = 2; q <= n; q += 2) smallestPrimeFactor[q] = 2;
  for (int q = 3; q <= n; q += 6) smallestPrimeFactor[q] = 3;
  for (int q = 5; q <= n5; q += 2) {
    if (smallestPrimeFactor[q] == 0) primes[P++] = smallestPrimeFactor[q] = q;
    int bound = smallestPrimeFactor[q];
    for (int i = 2;; ++i) {
      int p = primes[i];
      if (p > bound) break;
      int pq = p * q;
      if (pq > n) break;
      smallestPrimeFactor[pq] = p;
    }
  }
  for (int q = (n5 + 1) | 1; q <= n; q += 2) {
    if (smallestPrimeFactor[q] == 0) primes[P++] = smallestPrimeFactor[q] = q;
  }
  primes.resize(P);
}
void primeFactors(int x, vector<pair<int, int>> &out_v) {
  linearSieve(x);
  out_v.clear();
  while (x != 1) {
    int p = smallestPrimeFactor[x], k = 0;
    x /= p, k++;
    while (x % p == 0) x /= p, k++;
    out_v.push_back(make_pair(p, k));
  }
}
template <int MOD>
struct ModInt {
  static const int Mod = MOD;
  unsigned x;
  ModInt() : x(0) {}
  ModInt(signed sig) {
    int sigt = sig % MOD;
    if (sigt < 0) sigt += MOD;
    x = sigt;
  }
  ModInt(signed long long sig) {
    int sigt = sig % MOD;
    if (sigt < 0) sigt += MOD;
    x = sigt;
  }
  int get() const { return (int)x; }
  ModInt &operator+=(ModInt that) {
    if ((x += that.x) >= MOD) x -= MOD;
    return *this;
  }
  ModInt &operator-=(ModInt that) {
    if ((x += MOD - that.x) >= MOD) x -= MOD;
    return *this;
  }
  ModInt &operator*=(ModInt that) {
    x = (unsigned long long)x * that.x % MOD;
    return *this;
  }
  ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
  ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
  ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
  ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
  ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
  ModInt inverse() const {
    signed a = x, b = MOD, u = 1, v = 0;
    while (b) {
      signed t = a / b;
      a -= t * b;
      std::swap(a, b);
      u -= t * v;
      std::swap(u, v);
    }
    if (u < 0) u += Mod;
    ModInt res;
    res.x = (unsigned)u;
    return res;
  }
  bool operator==(ModInt that) const { return x == that.x; }
  bool operator!=(ModInt that) const { return x != that.x; }
  ModInt operator-() const {
    ModInt t;
    t.x = x == 0 ? 0 : Mod - x;
    return t;
  }
};
template <int MOD>
ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
  ModInt<MOD> r = 1;
  while (k) {
    if (k & 1) r *= a;
    a *= a;
    k >>= 1;
  }
  return r;
}
class SchieberVishkinLCA {
 public:
 private:
  static inline unsigned lowestOneBit(unsigned v) { return v & (~v + 1); }
  static inline unsigned highestOneBitMask(unsigned v) {
    v |= v >> 1;
    v |= v >> 2;
    v |= v >> 4;
    v |= v >> 8;
    v |= v >> 16;
    return v >> 1;
  }
  std::vector<unsigned> indices;
  std::vector<unsigned> maxHIndices;
  std::vector<unsigned> ancestorHeights;
  std::vector<int> pathParents;

 public:
  void build(const std::vector<int> &preorder, const std::vector<int> &parents,
             int root) {
    int N = static_cast<int>(preorder.size());
    ancestorHeights.resize(N);
    maxHIndices.resize(N);
    indices.resize(N);
    pathParents.resize(N);
    for (int ix = 0; ix < N; ++ix) indices[preorder[ix]] = ix + 1;
    for (int i = 0; i < N; ++i) maxHIndices[i] = indices[i];
    for (int ix = N - 1; ix > 0; --ix) {
      int v = preorder[ix], parent = parents[v];
      if (lowestOneBit(maxHIndices[parent]) < lowestOneBit(maxHIndices[v]))
        maxHIndices[parent] = maxHIndices[v];
    }
    ancestorHeights[root] = 0;
    for (int ix = 1; ix < N; ++ix) {
      int v = preorder[ix], parent = parents[v];
      ancestorHeights[v] =
          ancestorHeights[parent] | lowestOneBit(maxHIndices[v]);
    }
    pathParents[0] = root;
    for (int ix = 1; ix < N; ++ix) {
      int v = preorder[ix], parent = parents[v];
      if (maxHIndices[v] != maxHIndices[parent])
        pathParents[indices[v] - 1] = parent;
      else
        pathParents[indices[v] - 1] = pathParents[indices[parent] - 1];
    }
  }
  int query(int v, int u) const {
    unsigned Iv = maxHIndices[v], Iu = maxHIndices[u];
    unsigned hIv = lowestOneBit(Iv), hIu = lowestOneBit(Iu);
    unsigned hbMask = highestOneBitMask((Iv ^ Iu) | hIv | hIu);
    unsigned j =
        lowestOneBit(ancestorHeights[v] & ancestorHeights[u] & ~hbMask);
    int x, y;
    if (j == hIv)
      x = v;
    else {
      unsigned kMask = highestOneBitMask(ancestorHeights[v] & (j - 1));
      x = pathParents[(indices[v] & ~kMask | (kMask + 1)) - 1];
    }
    if (j == hIu)
      y = u;
    else {
      unsigned kMask = highestOneBitMask(ancestorHeights[u] & (j - 1));
      y = pathParents[(indices[u] & ~kMask | (kMask + 1)) - 1];
    }
    return indices[x] < indices[y] ? x : y;
  }
};
vector<int> t_parent;
vector<int> t_ord;
void tree_getorder(const vector<vector<int>> &g, int root) {
  int n = g.size();
  t_parent.assign(n, -1);
  t_ord.clear();
  vector<int> stk;
  stk.push_back(root);
  while (!stk.empty()) {
    int i = stk.back();
    stk.pop_back();
    t_ord.push_back(i);
    for (int j = (int)g[i].size() - 1; j >= 0; j--) {
      int c = g[i][j];
      if (t_parent[c] == -1 && c != root) {
        t_parent[c] = i;
        stk.push_back(c);
      }
    }
  }
}
vector<ModInt<1000000007>> modInverse;
void computeModInverse(int n) {
  n = max(n, 1);
  modInverse.resize(n + 1);
  modInverse[1] = 1;
  for (int i = 2; i <= n; ++i)
    modInverse[i].x = (long long)modInverse[ModInt<1000000007>::Mod % i].x *
                      (ModInt<1000000007>::Mod - ModInt<1000000007>::Mod / i) %
                      ModInt<1000000007>::Mod;
}
int main() {
  const int X = 10000000;
  linearSieve(X);
  computeModInverse(X);
  int n;
  while (~scanf("%d", &n)) {
    vector<vector<int>> g(n);
    for (int i = 0; i < n - 1; ++i) {
      int u, v;
      scanf("%d%d", &u, &v), --u, --v;
      g[u].push_back(v);
      g[v].push_back(u);
    }
    tree_getorder(g, 0);
    SchieberVishkinLCA lca;
    lca.build(t_ord, t_parent, 0);
    vector<int> as(n);
    for (int i = 0; i < n; ++i) scanf("%d", &as[i]);
    vector<int> ppid(X + 1, -1);
    int nIds = 0;
    for (int p : primes) {
      int q = p;
      while (1) {
        ppid[q] = nIds++;
        if ((long long)q * p > X) break;
        q *= p;
      }
    }
    vector<vector<pair<int, int>>> queries(n);
    vector<pair<int, int>> fs;
    int q;
    scanf("%d", &q);
    for (int qi = 0; qi < q; ++qi) {
      int u;
      int v;
      int x;
      scanf("%d%d%d", &u, &v, &x), --u, --v;
      int w = lca.query(u, v);
      primeFactors(x, fs);
      for (auto f : fs) {
        int q = 1;
        for (int k = 0; k < f.second; ++k) q *= f.first;
        queries[u].emplace_back(ppid[q], qi * 3 + 0);
        queries[v].emplace_back(ppid[q], qi * 3 + 0);
        queries[w].emplace_back(ppid[q], qi * 3 + 1);
        if (t_parent[w] != -1)
          queries[t_parent[w]].emplace_back(ppid[q], qi * 3 + 2);
      }
    }
    vector<ModInt<1000000007>> curProd(nIds, 1);
    vector<ModInt<1000000007>> ansProds(q * 3, 1);
    vector<pair<int, int>> history;
    function<void(int)> dfs = [&](int i) {
      primeFactors(as[i], fs);
      size_t histstart = history.size();
      for (auto f : fs) {
        int q = 1, r = 1;
        for (int k = 1;; ++k) {
          if ((long long)q * f.first > X) break;
          q *= f.first;
          if (k <= f.second) r *= f.first;
          int id = ppid[q];
          curProd[id] *= r;
          history.emplace_back(id, r);
        }
      }
      for (auto q : queries[i]) ansProds[q.second] *= curProd[q.first];
      for (int j : g[i])
        if (t_parent[i] != j) dfs(j);
      while (history.size() > histstart) {
        int id, r;
        tie(id, r) = history.back();
        curProd[id] *= modInverse[r];
        history.pop_back();
      }
    };
    dfs(0);
    for (int i = 0; i < q; ++i) {
      ModInt<1000000007> ans =
          ansProds[i * 3 + 0] / (ansProds[i * 3 + 1] * ansProds[i * 3 + 2]);
      printf("%d\n", ans.get());
    }
  }
}