#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e5+5,MOD=998244353;
inline int ksm(int a,int b=MOD-2,int p=MOD) {
	int ret=1;
	for(;b;a=1ll*a*a%p,b=b>>1) if(b&1) ret=1ll*ret*a%p;
	return ret;
}
int p[MAXN],tot[MAXN],s1[MAXN],s2[MAXN],s3[MAXN];
int st[MAXN][20],dfn[MAXN],rdfn[MAXN],dcnt,Fa[MAXN];
inline int cmp(int x,int y) { return dfn[x]<dfn[y]?x:y; }
vector <int> G[MAXN];
inline void dfs(int u,int fa) {
	dfn[u]=++dcnt,st[dcnt][0]=Fa[u]=fa;
	for(int v:G[u]) tot[u]=(tot[u]+p[v])%MOD;
	s1[u]=ksm(1ll*p[u]*p[fa]%MOD);
	s2[u]=(s2[fa]+1ll*tot[u]*p[u])%MOD;
	s3[u]=(s3[fa]+1ll*tot[u]*p[u]%MOD*s1[u])%MOD;
	s1[u]=(s1[u]+s1[fa])%MOD;
	for(int v:G[u]) if(v^fa) dfs(v,u);
	rdfn[u]=dcnt;
}
inline int bit(int k) { return 1<<k; }
inline int LCA(int u,int v) {
	if(u==v) return u;
	int l=min(dfn[u],dfn[v])+1,r=max(dfn[u],dfn[v]),k=__lg(r-l+1);
	return cmp(st[l][k],st[r-bit(k)+1][k]);
}
signed main() {
	int n,q;
	scanf("%d",&n);
	for(int i=1;i<=n;++i) scanf("%d",&p[i]);
	for(int i=1,u,v;i<n;++i) scanf("%d%d",&u,&v),G[u].push_back(v),G[v].push_back(u);
	dfs(1,0);
	for(int k=1;k<20;++k) for(int i=1;i+bit(k-1)<=n;++i) st[i][k]=cmp(st[i][k-1],st[i+bit(k-1)][k-1]);
	scanf("%d",&q);
	for(int s,x,y;q--;) {
		scanf("%d%d%d",&s,&x,&y);
		int k=LCA(x,y);
		if(dfn[k]<=dfn[s]&&dfn[s]<=rdfn[k]) {
			if(LCA(s,x)==k) swap(x,y);
			int p=LCA(s,x);
			printf("%lld\n",(1ll*s1[p]*(s2[x]+MOD-s2[p])%MOD+(s3[p]+MOD-s3[Fa[k]])+1ll*s1[k]*(s2[y]+MOD-s2[k])%MOD)%MOD);
		} else printf("%lld\n",1ll*s1[k]*(s2[x]+s2[y]+MOD*2-s2[k]-s2[Fa[k]])%MOD);
	}
	return 0;
}