#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001
using P = pair<long long,mint>;
vector<vector<P>> TT;
template <class Ss, Ss (*op0)(Ss, Ss), Ss (*e)(), class Sv, Ss (*op1)(Sv, Ss), class Se, Ss (*op2)(Se, Ss)>
struct rerooting{
	
	int n;
	vector<vector<int>> to;
	vector<vector<Se>> edge;
	
	vector<Ss> subtree,answer;
	
	vector<Sv> vertex;
	
	rerooting(int _n){
		n = _n;
		to.resize(n);
		edge.resize(n);
		subtree.resize(n,e());
		answer.resize(n,e());
		vertex.resize(n);
	}
	
	rerooting(vector<Sv> v){
		n = v.size();
		to.resize(n);
		edge.resize(n);
		subtree.resize(n,e());
		answer.resize(n,e());
		vertex = v;
	}
	
	void add_directed_edge(int u,int v,Se x){
		to[u].push_back(v);
		edge[u].push_back(x);
	}
	
	void add_edge(int u,int v,Se x){
		add_directed_edge(u,v,x);
		add_directed_edge(v,u,x);
	}
	
	void solve(){
		dfs(0,-1);
		redfs(0,-1,e());
	}
	
	void dfs(int cur,int par){
		Ss temp = e();
		for(int i=0;i<to[cur].size();i++){
			int nxt = to[cur][i];
			if(nxt==par)continue;
			dfs(nxt,cur);
			temp = op0(temp, op2(edge[cur][i], subtree[nxt]));
		}
		subtree[cur] = op1(vertex[cur], temp);
	}
	
	void redfs(int cur, int par, Ss ps){
		vector<Ss> P(to[cur].size()+1,e());
		rep(i,to[cur].size()){
			int nxt = to[cur][i];
			if(nxt!=par){
				P[i+1] = op2(edge[cur][i], subtree[nxt]);
				TT[cur].push_back(subtree[nxt]);
			}
			else {
				P[i+1] = op2(edge[cur][i], ps);
				TT[cur].push_back(ps);
			}
		}
		vector<Ss> S(P.rbegin(),P.rend()-1);
		S.insert(S.begin(),e());
		rep(i,to[cur].size()){
			P[i+1] = op0(P[i], P[i+1]);
			S[i+1] = op0(S[i+1], S[i]);
		}
		answer[cur] = op1(vertex[cur], P.back());

		for(int i=0;i<to[cur].size();i++){
			int nxt = to[cur][i];
			if(nxt!=par){
				redfs(nxt,cur,op1(vertex[cur], op0(P[i],S[to[cur].size()-1-i])));
			}
		}
	}
	
};



P op0(P a,P b){
	return make_pair(a.first+b.first, a.second+b.second);
}

P e(){
	return make_pair(0LL,0);
}

P op1(long long a,P b){
	b.first++;
	b.second++;
	b.second *= mint(10).pow(a);
	return b;
}

P op2(long long a,P b){
	return b;
}

int main(){
	
	int N;
	cin>>N;
	vector<string> s(N);
	vector<long long> c(N);
	rep(i,N){
		cin>>s[i];
		c[i] = s[i].size();
	}
	TT.resize(N);
	rerooting<P,op0,e,long long,op1,long long,op2> R(c);
	rep(i,N-1){
		int a,b;
		cin>>a>>b;
		a--,b--;
		R.add_edge(a,b,0);
	}
	
	R.solve();
	mint ans = 0;
	rep(i,N){
		rep(j,TT[i].size()){
			auto p = TT[i][j];
			ans += p.second * stoll(s[i]) * (N-p.first);
			//cout<<p.first<<','<<p.second.val()<<endl;
		}
		ans += mint(N) * stoll(s[i]);
	}
	cout<<ans.val()<<endl;
	return 0;
}