#include <bits/stdc++.h>

using namespace std;

#define pb emplace_back
#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

const int P = 998244353;

const int N = 1e5 + 10;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  return x * f;
}

int inc(int a, int b) { return (a += b) >= P ? a - P : a; }
int dec(int a, int b) { return (a -= b) < 0 ? a + P : a; }
int mul(int a, int b) { return 1ll * a * b % P; }
int qpow(int a, int b) { int res = 1; for (; b; b >>= 1, a = mul(a, a)) if (b & 1) res = mul(res, a); return res; }

int n, a[N], k[N], b[N], x[N], dfn[N], dn, p[N], dep[N], st[N][20];
vector <int> e[N];

void dfs0(int u, int fa) {
  dfn[u] = ++ dn, st[dfn[u]][0] = u, p[u] = fa;
  if (u == 2) k[u] = 1, b[u] = 0;
  else if (u > 2) {
    int q = mul(a[p[p[u]]], qpow(a[p[p[u]]] + a[u], P - 2)), iv = qpow(dec(1, q), P - 2);
    k[u] = mul(dec(k[p[u]], mul(q, k[p[p[u]]])), iv);
    b[u] = mul(dec(dec(b[p[u]], mul(q, b[p[p[u]]])), 1), iv);
  }
  x[u] = mul(dec(dec(b[u], b[p[u]]), 1), qpow(dec(k[p[u]], k[u]), P - 2));
  for (int v : e[u]) if (v != fa) {
    dep[v] = dep[u] + 1, dfs0(v, u);
  }
  // cout << "u, k[u], b[u], x[u] = " << u << ' ' << k[u] << ' ' << b[u] << ' ' << x[u] << endl;
}

int Min(int u, int v) {
  return dep[u] < dep[v] ? u : v;
}

int LCA(int u, int v) {
  if (u == v) return u;
  u = dfn[u], v = dfn[v];
  if (u > v) swap(u, v);
  int t = __lg(v - u);
  return p[Min(st[u + 1][t], st[v - (1 << t) + 1][t])];
}

int main() {
  n = read();
  rep(i, 1, n) a[i] = read();
  rep(i, 1, n - 1) {
    int u = read(), v = read();
    e[u].pb(v), e[v].pb(u);
  }
  dfs0(1, 0);
  rep(j, 1, 19) rep(i, 1, n - (1 << j) + 1) {
    st[i][j] = Min(st[i][j - 1], st[i + (1 << j - 1)][j - 1]);
  }
  for (int q = read(); q; -- q) {
    auto ask = [&](int u, int v) {
      if (u == 1) return 0;
      int lca = LCA(u, v);
      // cout << "u, v, lca = " << u << ' ' << v << ' ' << lca << endl;
      return inc(mul(k[lca], x[u]), b[lca]);
    } ;
    int s = read(), u = read(), v = read(), lca = LCA(u, v), res = 0;
    res = inc(res, inc(ask(u, s), ask(v, s)));
    res = dec(res, inc(ask(lca, s), ask(p[lca], s)));
    printf("%d\n", res);
  }
  return 0;
}