import sys
sys.setrecursionlimit(2*10**5)

def fast(N,A,G):
    mod=998244353

    def dfs(p,prev=-1):
        sm,sm2,ans=0,0,0
        for e in G[p]:
            if e==prev:continue
            esm,eans=dfs(e,p)
            sm=(sm+esm)%mod
            sm2=(sm2+esm**2)%mod
            ans=(ans+eans)%mod
        ans=(ans+A[p]*(sm**2-sm2)*pow(2,mod-2,mod)+A[p]*sm)%mod
        return ((sm+1)*A[p])%mod,ans

    return dfs(0)[1]

def naive(N,A,G):
    
    mod=998244353
    def dfs(p,prod,par,prev=-1)->int:
        ans=0
        prod=(prod*A[p])%mod
        if p<par:
            ans=(ans+prod)%mod
        for e in G[p]:
            if e==prev:continue
            ans=(ans+dfs(e,prod,par,p))%mod
        return ans
    ans=0
    for i in range(N):
        ans=(ans+dfs(i,1,i))%mod
    return ans

N=int(input())
A=list(map(int,input().split()))
G=[[]for i in range(N)]
for i in range(N-1):
    u,v=map(int,input().split())
    u-=1
    v-=1
    G[u].append(v)
    G[v].append(u)

print(fast(N,A,G))