#include using namespace std; //#pragma GCC optimize("Ofast") #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<> #define rev(x) reverse(x); using ll=long long; using vl=vector; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[9]={1,0,-1,0,1,1,-1,-1,0}; const ll dx[9]={0,1,0,-1,1,-1,1,-1,0}; template inline bool chmin(T& a, T b) { if (a >= b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } const int mod = MOD9; const int max_n = 200005; struct mint { ll x; // typedef long long ll; mint(ll x=0):x((x%mod+mod)%mod){} mint operator-() const { return mint(-x);} mint& operator+=(const mint a) { if ((x += a.x) >= mod) x -= mod; return *this; } mint& operator-=(const mint a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; } mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;} mint operator+(const mint a) const { return mint(*this) += a;} mint operator-(const mint a) const { return mint(*this) -= a;} mint operator*(const mint a) const { return mint(*this) *= a;} mint pow(ll t) const { if (!t) return 1; mint a = pow(t>>1); a *= a; if (t&1) a *= *this; return a; } bool operator==(const mint &p) const { return x == p.x; } bool operator!=(const mint &p) const { return x != p.x; } // for prime mod mint inv() const { return pow(mod-2);} mint& operator/=(const mint a) { return *this *= a.inv();} mint operator/(const mint a) const { return mint(*this) /= a;} }; istream& operator>>(istream& is, mint& a) { return is >> a.x;} ostream& operator<<(ostream& os, const mint& a) { return os << a.x;} using vm=vector; using vvm=vector; struct combination { vector fact, ifact; combination(int n):fact(n+1),ifact(n+1) { assert(n < mod); fact[0] = 1; for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i; ifact[n] = fact[n].inv(); for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i; } mint operator()(int n, int k) { if (k < 0 || k > n) return 0; return fact[n]*ifact[k]*ifact[n-k]; } }comb(max_n); ll n; vvl g(100010); vm cof(100010); vm sec(100010); vm dp(100010); vm ep(100010); vm ans(100010); vm sz(100010); //m szup(100010); void dfs(ll v,ll par=-1){ sz[v]=1; for(auto p:g[v]){ if(p==par)continue; dfs(p,v); dp[v]+=dp[p]; sz[v]+=sz[p]; } dp[v]=dp[v]*cof[v]+sec[v]*sz[v]; } void bfs(ll v,ll par=-1){ mint sum=ep[v]; for(auto p:g[v]){ if(p==par)continue; sum+=dp[p]; } ans[v]=sum*cof[v]+sec[v]*n; for(auto p:g[v]){ if(p==par)continue; ep[p]=(sum-dp[p])*cof[v]+sec[v]*(mint(n)-sz[p]); bfs(p,v); } } int main(){ cin >> n; rep(i,n){ string a;cin >> a; cof[i]=mint(10).pow(a.size()); sec[i]=mint(stoll(a)); } rep(i,n-1){ ll a,b;cin >> a >> b;a--;b--; g[a].emplace_back(b); g[b].emplace_back(a); } dfs(0); bfs(0); mint ret=0;rep(i,n)ret+=ans[i]; cout << ret << endl; //rep(i,n)cout << ans[i] << endl; }