using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static long[] NList => ReadLine().Split().Select(long.Parse).ToArray();
    static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
    static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var a = NList;
        var map = NMap(n - 1);
        var tree = new List<Edge>[n];
        for (var i = 0; i < tree.Length; ++i) tree[i] = new List<Edge>();
        foreach (var edge in map)
        {
            tree[edge[0]].Add(new Edge(edge[1]));
            tree[edge[1]].Add(new Edge(edge[0]));
        }
        var mod = 998_244_353;
        var mul = new long[n];
        for (var i = 0; i < n; ++i)
        {
            mul[i] = 10;
            while (a[i] >= mul[i]) mul[i] *= 10;
            a[i] %= mod;
            mul[i] %= mod;
        }
        var dp = new long[n];
        var count = new long[n];
        DFS1(-1, 0, tree, a, mul, count, dp);
        // WriteLine(string.Join(" ", dp));
        DFS2(-1, 0, 0L, 0L, tree, a, mul, count, dp);
        // WriteLine(string.Join(" ", dp));
        WriteLine(dp.Sum() % mod);
    }
    static int mod = 998_244_353;
    static void DFS1(int prev, int cur, List<Edge>[] tree, long[] a, long[] mul, long[] count, long[] dp)
    {
        var sum = 0L;
        foreach (var next in tree[cur])
        {
            if (prev == next.To) continue;
            DFS1(cur, next.To, tree, a, mul, count, dp);
            count[cur] += count[next.To];
            next.Coi = count[next.To];
            next.Dpi = (dp[next.To] * mul[cur] % mod + a[cur] * count[next.To] % mod) % mod;
            sum = (sum + next.Dpi) % mod;
        }
        ++count[cur];
        dp[cur] = (sum + a[cur]) % mod;
    }
    static void DFS2(int prev, int cur, long ci, long di, List<Edge>[] tree, long[] a, long[] mul, long[] count, long[] dp)
    {
        var dsum = (di * mul[cur] % mod + a[cur] * ci % mod + dp[cur]) % mod;
        var csum = (ci + count[cur]) % mod;
        foreach (var next in tree[cur])
        {
            if (prev == next.To) continue;
            // WriteLine($"call DFS2 {cur} to {next.To}, ci = {csum - next.Coi}, di = {dsum - next.Dpi}");
            DFS2(cur, next.To, (csum - next.Coi + mod) % mod, (dsum - next.Dpi + mod) % mod, tree, a, mul, count, dp);
        }
        dp[cur] = dsum;
    }
    class Edge
    {
        public int To;
        public long Dpi;
        public long Coi;
        public Edge(int to)
        {
            To = to;
        }
    }
}