from sys import stdin
input = stdin.readline
from types import GeneratorType

def bootstrap(f, stack=[]):
    def wrappedfunc(*args, **kwargs):
        if stack:
            return f(*args, **kwargs)
        to = f(*args, **kwargs)
        while True:
            if type(to) is GeneratorType:
                stack.append(to)
                to = next(to)
            else:
                stack.pop()
                if not stack:
                    break
                to = stack[-1].send(to)
        return to
    return wrappedfunc

MOD = 998244353

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

NL = [len(str(a)) for a in A]
POW = [1]
for _ in range(10):
    POW.append(POW[-1]*10%MOD)

@bootstrap
def dfs(n, p):
    SUM = 0
    cnt = 1
    for eidx, v in enumerate(G[n]):
        if v == p: continue
        a, c = yield dfs(v, n)
        SUM += a
        SUM %= MOD
        cnt += c
        cnt %= MOD
        dp[n][eidx] = a
        dp2[n][eidx] = c
    SUM *= POW[NL[n]]
    SUM %= MOD
    SUM += A[n]*cnt%MOD
    SUM %= MOD
    yield SUM, cnt

dp = [[0]*len(G[i]) for i in range(N)]
dp2 = [[0]*len(G[i]) for i in range(N)]
dfs(0, -1)

def LRset(n):
    for i in range(1, len(G[n])):
        L[n][i] = (L[n][i-1]+dp[n][i-1])%MOD
        L2[n][i] = (L2[n][i-1]+dp2[n][i-1])%MOD
    for i in reversed(range(len(G[n])-1)):
        R[n][i] = (R[n][i+1]+dp[n][i+1])%MOD
        R2[n][i] = (R2[n][i+1]+dp2[n][i+1])%MOD

L = [[0]*len(G[i]) for i in range(N)]
L2 = [[0]*len(G[i]) for i in range(N)]
R = [[0]*len(G[i]) for i in range(N)]
R2 = [[0]*len(G[i]) for i in range(N)]
LRset(0)

@bootstrap
def rerooting(n, pre, no):
    visited[n] = True
    preno = 0
    for i in range(len(G[n])):
        if G[n][i] == pre:
            preno = i
            break
    dp2[n][preno] = (L2[pre][no]+R2[pre][no]+1)%MOD
    dp[n][preno] = ((L[pre][no]+R[pre][no])%MOD*POW[NL[pre]]%MOD+A[pre]*dp2[n][preno]%MOD)%MOD
    LRset(n)
    for i in range(len(G[n])):
        if not visited[G[n][i]]:
            yield rerooting(G[n][i], n, i)
    yield

visited = [False]*N
visited[0] = True
for i in range(len(G[0])):
    if not visited[G[0][i]]:
        rerooting(G[0][i], 0, i)

ans = sum(A)%MOD
for n in range(N):
    for eidx, v in enumerate(G[n]):
        ans += (dp[n][eidx]*POW[NL[n]]%MOD+A[n]*dp2[n][eidx]%MOD)%MOD
        ans %= MOD

print(ans)