#include "bits/stdc++.h" #include #include #pragma warning(push) #pragma warning(disable:26498 26450 26451 26812) #include "atcoder/all" #pragma warning(pop) //#include //using namespace boost::multiprecision; // std::fixed << std::setprecision(10) << using namespace std; using namespace atcoder; using ll = long long; using ull = unsigned long long; using mint = modint998244353; using mint2 = modint1000000007; const double eps = 1e-9; #define REP(i, n) for (ll i = 0; i < ll(n); ++i) #define REPI(i, init, n) for (ll i = init; i < ll(n); ++i) #define REPD(i, init) for (ll i = init; i >=0; --i) #define REPDI(i, init, n) for (ll i = init; i >=n; --i) #define REPE(i, c) for (const auto& i : c) using vl = vector; #define VL(a, n) vector a; a.assign(n, 0); #define VLI(a, n) vector a; a.assign(n, 0); for(auto& x : a) cin >> x; #define VSI(a, n) vector a; a.assign(n, ""); for(auto& x : a) cin >> x; using vvl = vector>; #define VVLI(a, n, m, init) vector> a(n); for(auto& x : a) x.assign(m, init); struct uv { ll u; ll v; ll c; }; #define VUVI(a, n) vector a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;} #define VUVCI(a, n) vector a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;} vvl to_edge(const ll n, const vector& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; } vvl to_edge_d(const ll n, const vector& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; } template using pql = priority_queue; template using pqg = priority_queue, greater>; const char* YES = "Yes"; const char* NO = "No"; void yn(bool f) { std::cout << (f ? YES : NO) << endl; }; template void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } }; const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値 template bool chmin(T& a, const U& b) { a = min(a, b); return b == a; } template bool chmax(T& a, const U& b) { a = max(a, b); return b == a; } template void mysort(T& v) { std::sort(begin(v), end(v)); }; template void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); }; template void myrev(T& v) { std::reverse(begin(v), end(v)); }; ll rk(ll n) { ll ret = 0; while (n > 0) { n /= 10; ret++; } return ret; } vl a; vvl ed; vector>> tdp; vector ans; pair dfs(ll n, ll p) { mint ret = 0; ll c = 1; REPE(x, ed[n]) { if (x == p) { tdp[n].push_back({ 0, 0 }); continue; } auto p = dfs(x, n); tdp[n].push_back(p); auto v = p.first; auto ci = p.second; ret += v * mint(10).pow(rk(a[n])) + a[n] * ci; c += ci; } ret += a[n]; return { ret, c }; } void dfs2(ll n, ll p, mint d, ll cp) { mint sum = d; ll csum = cp; REPE(e, tdp[n]) { sum += e.first; csum += e.second; } ans[n] = sum * mint(10).pow(rk(a[n])) + a[n] * csum; REP(i, ed[n].size()) { ll x = ed[n][i]; if (x == p) continue; mint xt = tdp[n][i].first; ll ct = tdp[n][i].second; mint nv = (sum - xt) * mint(10).pow(rk(a[n])) + a[n] * (csum - ct + 1); dfs2(x, n, nv, csum - ct + 1); } } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); ll n; cin >> n; a.assign(n, 0); REP(i, n)cin >> a[i]; VUVI(e, n-1); ed = to_edge_d(n, e); tdp.assign(n, {}); ans.assign(n, 0); dfs(0, -1); dfs2(0, -1, 0, 0); mint ao = 0; REP(i, n) { ao += ans[i]; ao += a[i]; } cout << ao.val() << endl; return 0; }