#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+5,mod=998244353;
inline int powmod(int a,int b){int c=1;while(b){if(b&1)c=(ll)c*a%mod;a=(ll)a*a%mod;b>>=1;}return c;}
inline int inv(int x){return powmod(x,mod-2);}
struct E{int to,next;}edge[N<<1];
int n,q,head[N],tot,v[N],du[N],fa[N],dep[N],f[N],g[N],h[N],vis[N];
vector<int> vec;
void dfs(int u,int ff)
{
    if(u==2)g[u]=1;
    if(u>2)
    {
        int x=fa[u],y=fa[x];
        int p1=(ll)v[u]*inv(v[y]+v[u])%mod;
        int p2=(ll)v[y]*inv(v[y]+v[u])%mod*f[x]%mod;
        int p=(ll)p1*inv(1-p2+mod)%mod;
        f[u]=p;
        g[u]=(ll)g[fa[u]]*f[u]%mod;
    }
    if(u!=1)
    {
        int c=((ll)(du[u]-1)*inv(du[u])%mod+(ll)inv(du[u])*f[u]%mod)%mod;
        h[u]=inv(1-c+mod);
    }
    for(int i=head[u];i!=-1;i=edge[i].next)if(edge[i].to!=ff)
        fa[edge[i].to]=u,dep[edge[i].to]=dep[u]+1,dfs(edge[i].to,u);

}
inline void getpath(int u,int v)
{
    vec.clear();
    while(u!=v)
    {
        if(dep[u]>dep[v])vec.push_back(u),u=fa[u];
        else if(dep[u]<dep[v])vec.push_back(v),v=fa[v];
        else vec.push_back(u),u=fa[u],vec.push_back(v),v=fa[v];
    }
    vec.push_back(u);
}
inline void paint(int u)
{
    memset(vis,0,sizeof(vis));
    while(u)vis[u]=1,u=fa[u];
}
inline int calc(int u)
{
    if(u==1)return 1;
    int v=u;
    while(!vis[v])v=fa[v];
    return (ll)h[u]*g[u]%mod*inv(g[v])%mod;
}
int main()
{
    memset(head,-1,sizeof(head));
    scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%d",&v[i]);
    for(int i=1;i<n;i++)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        du[x]++;du[y]++;
        edge[++tot]=(E){y,head[x]};head[x]=tot;
        edge[++tot]=(E){x,head[y]};head[y]=tot;
    }
    dfs(1,0);
    scanf("%d",&q);
    while(q--)
    {
        int s,u,v;
        scanf("%d%d%d",&s,&u,&v);
        getpath(u,v);
        paint(s);
        int ans=0;
        for(int i=0;i<vec.size();i++)ans=(ans+calc(vec[i]))%mod;
        printf("%d\n",ans);
    }
    return 0;
}