#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],t[N],k[N],vis[N],st[N][20];
vector<int> vec;
void dfs(int u,int ff)
{
    st[u][0]=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 sum=0;
        for(int i=head[u];i!=-1;i=edge[i].next)sum=(sum+v[edge[i].to])%mod;
        int c=((ll)(sum-v[fa[u]]+mod)*inv(sum)%mod+(ll)v[fa[u]]*inv(sum)%mod*f[u]%mod)%mod;
        h[u]=inv(1-c+mod);
        t[u]=(t[ff]+(ll)h[u]*g[u]%mod)%mod;
        k[u]=(k[ff]+h[u])%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;
}
inline int lca(int x,int y)
{
    if(dep[x]<dep[y])swap(x,y);
    for(int i=19;i>=0;i--)if(dep[st[x][i]]>dep[y])x=st[x][i];
    if(dep[x]>dep[y])x=st[x][0];
    for(int i=19;i>=0;i--)if(st[x][i]&&st[x][i]!=st[y][i])x=st[x][i],y=st[y][i];
    if(x!=y)x=st[x][0],y=st[y][0];
    return x;
}
inline int getans(int s,int u,int v)
{
    int p=lca(s,u),q=lca(s,v);
    if(p==u)
    {
        int x=(k[q]-k[fa[u]]+mod)%mod;
        int y=(t[v]-t[q]+mod)%mod;
        y=(ll)y*inv(g[q])%mod;
        return (x+y)%mod;
    }
    int y=(t[v]-t[fa[u]]+mod)%mod;
    y=(ll)y*inv(g[p])%mod;
    return y;
}
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);
    for(int j=1;j<20;j++)
        for(int i=1;i<=n;i++)st[i][j]=st[st[i][j-1]][j-1];
    scanf("%d",&q);
    while(q--)
    {
        int s,u,v;
        scanf("%d%d%d",&s,&u,&v);
        int w=lca(u,v);
        //int l=(t[u]-t[w]+mod)%mod,r=(t[v]-t[w]+mod)%mod,m=(ll)h[w]*g[w]%mod;
        //printf("%d\n",((l+r)%mod+m)%mod);
        int l=getans(s,w,u),r=getans(s,w,v),m=getans(s,w,w);
        printf("%d\n",((l+r)%mod-m+mod)%mod);
    }
    return 0;
}