#include <bits/stdc++.h>
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> inline void chkmax(T& x, T y) { x = max(x, y); }
template <typename T> inline void chkmin(T& x, T y) { x = min(x, y); }
template <typename T> inline void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	x *= f;
}
const int N = 1e5 + 10, MOD = 998244353;
int n, q, val[N], vv[N], sum1[N], sum2[N], sum3[N], tot[N], fa[N];
int st[21][N], lg[N], dfn[N], rdfn[N], dfscnt;
vector <int> v[N];
inline int power(int x, int y = MOD - 2) {
	int ans = 1;
	for (; y; x = (ll) x * x % MOD, y >>= 1)
		if (y & 1) ans = (ll) ans * x % MOD;
	return ans;
}
void dfs(int x, int fa) {
	st[0][dfn[x] = ++dfscnt] = ::fa[x] = fa;
	vv[x] = power((ll) val[1] * val[2] % MOD);
	for (int i: v[x]) tot[x] = (tot[x] + val[i]) % MOD;
	sum1[x] = (sum1[fa] + vv[x]) % MOD;
	sum2[x] = (sum2[fa] + (ll) tot[x] * val[x]) % MOD;
	sum3[x] = (sum3[fa] + (ll) tot[x] * val[x] % MOD * sum1[x]) % MOD;
	for (int i: v[x])
		if (i != fa) dfs(i, x);
	rdfn[x] = dfscnt;
}
int marx(int x, int y) {
	return dfn[x] < dfn[y] ? x : y;
}
int lca(int x, int y) {
	if (x == y) return x;
	x = dfn[x], y = dfn[y];
	if (x > y) swap(x, y);
	int k = lg[y - x++];
	return marx(st[k][x], st[k][y - (1 << k) + 1]);
}
signed main() {
	read(n);
	F(i, 1, n) read(val[i]);
	F(i, 1, n - 1) {
		int x, y; read(x), read(y);
		v[x].push_back(y);
		v[y].push_back(x);
	}
	dfs(2, 1);
	F(i, 1, lg[n])
		F(j, 1, n - (1 << i) + 1)
			st[i][j] = marx(st[i - 1][j], st[i - 1][j + (1 << (i - 1))]);
	read(q);
	while (q--) {
		int s, x, y; read(s), read(x), read(y);
		int k = lca(x, y);
		if (dfn[k] <= dfn[s] && rdfn[s] <= rdfn[k]) {
			if (lca(x, s) != k) swap(x, y);
			int kk = lca(y, s);
			cout << ((ll) sum1[k] * (sum2[x] - sum2[fa[k]] + MOD) + (sum3[kk] - sum3[k] + MOD) + (ll) sum1[kk] * (sum2[y] - sum2[kk] + MOD)) % MOD << '\n';
		} else {
			int kk = lca(k, s);
			cout << (ll) sum1[kk] * ((ll) sum2[x] + sum2[y] - sum2[k] - sum2[fa[k]] + MOD * 2) % MOD << '\n';
		}
	}
	return 0;
}