#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<ctime>
#include<random>
#include<assert.h>
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define dbg(x) cerr<<"In Line "<< __LINE__<<" the "<<#x<<" = "<<x<<'\n'
#define dpi(x,y) cerr<<"In Line "<<__LINE__<<" the "<<#x<<" = "<<x<<" ; "<<"the "<<#y<<" = "<<y<<'\n'
#define DE(fmt,...) fprintf(stderr, "Line %d : " fmt "\n",__LINE__,##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef pair<ll,int>pli;
typedef pair<ll,ll>pll;
typedef pair<int,ll>pil;
typedef vector<int>vi;
typedef vector<ll>vll;
typedef vector<pii>vpii;
typedef vector<pll>vpll;
template<typename T>T cmax(T &x, T y){return x=x>y?x:y;}
template<typename T>T cmin(T &x, T y){return x=x<y?x:y;}
template<typename T>
T &read(T &r){
	r=0;bool w=0;char ch=getchar();
	while(ch<'0'||ch>'9')w=ch=='-'?1:0,ch=getchar();
	while(ch>='0'&&ch<='9')r=r*10+(ch^48),ch=getchar();
	return r=w?-r:r;
}
template<typename T1,typename... T2>
void read(T1 &x,T2& ...y){read(x);read(y...);}
const int mod=998244353;
inline void cadd(int &x,int y){x=(x+y>=mod)?(x+y-mod):(x+y);}
inline void cdel(int &x,int y){x=(x-y<0)?(x-y+mod):(x-y);}
inline int add(int x,int y){return (x+y>=mod)?(x+y-mod):(x+y);}
inline int del(int x,int y){return (x-y<0)?(x-y+mod):(x-y);}
int qpow(int x,int y){
	int s=1;
	while(y){
		if(y&1)s=1ll*s*x%mod;
		x=1ll*x*x%mod;
		y>>=1;
	}
	return s;
}
const int N=100010;
int n,q;
int a[N],va[N],s[N],vs[N];
int fa[N][17],dep[N],ok[N];
int f[N],g[N],h[N];
int sf[N],sg[N],sh[N];
int sum[N];
int L[N],R[N],dft;
vi eg[N];
void dfs1(int x,int pa){
	fa[x][0]=pa;L[x]=++dft;
	for(int i=1;i<17;i++)fa[x][i]=fa[fa[x][i-1]][i-1];
	dep[x]=dep[pa]+1;
	for(auto v:eg[x])if(v!=pa){
		dfs1(v,x);
	}R[x]=dft;
}
void dfs2(int x){
	sf[x]=add(sf[fa[x][0]],f[x]);
	sg[x]=add(sg[fa[x][0]],g[x]);
	h[x]=1ll*sg[x]*f[x]%mod;
	sh[x]=add(sh[fa[x][0]],h[x]);
	for(auto v:eg[x])if(v!=fa[x][0]){
		dfs2(v);
	}
}
int LCA(int x,int y){
	if(dep[x]<dep[y])swap(x,y);
	for(int i=16;~i;--i)if(dep[fa[x][i]]>=dep[y])x=fa[x][i];
	if(x==y)return x;
	for(int i=16;~i;--i)
		if(fa[x][i]!=fa[y][i])
			x=fa[x][i],y=fa[y][i];
	return fa[x][0];
}
int intr(int x,int y){//x in y
	return L[x]>=L[y]&&L[x]<=R[y];
}
signed main(){
	read(n);
	for(int i=1;i<=n;i++)read(a[i]),va[i]=qpow(a[i],mod-2);
	for(int i=1,u,v;i<n;i++){
		read(u,v);eg[u].pb(v);eg[v].pb(u);
		cadd(s[u],a[v]);
		cadd(s[v],a[u]);
	}
	for(int i=1;i<=n;i++)vs[i]=qpow(s[i],mod-2);
	dfs1(1,0);
	for(int i=1;i<=n;i++)f[i]=1ll*s[i]*a[i]%mod;
	for(int i=1;i<=n;i++)g[i]=1ll*va[fa[i][0]]*va[i]%mod;
	f[1]=g[1]=0;
	dfs2(1);
	read(q);
	for(int c=1;c<=q;c++){
		int s,x,y;read(s,x,y);
		int sx=LCA(s,x),xy=LCA(x,y),sy=LCA(s,y),ans=0;
		if(intr(xy,s)&&xy!=s){
			ans=1ll*del(add(sf[x],sf[y]),add(sf[xy],sf[fa[xy][0]]))*sg[s]%mod;
		}
		else if(sx==sy&&xy!=sx&&xy!=sy){
			ans=1ll*del(add(sf[x],sf[y]),add(sf[xy],sf[fa[xy][0]]))*sg[sx]%mod;
		}
		else{
			cadd(ans,1ll*del(sf[x],sf[sx])*sg[sx]%mod);
			cadd(ans,1ll*del(sf[y],sf[sy])*sg[sy]%mod);
			if(dep[sx]>dep[sy])swap(sx,sy);
			cadd(ans,del(sh[sy],sh[fa[sx][0]]));
		}
		cout<<ans<<'\n';
	}
    #ifdef do_while_true
//		cerr<<'\n'<<"Time:"<<1.0*clock()/CLOCKS_PER_SEC*1000<<" ms"<<'\n';
	#endif
	return 0;
}