#include <iostream>
using namespace std;
#define int long long
const int maxn = 500100,mod = 998244353;
const int inv2 = ((mod+1)>>1);
int siz[maxn],a[maxn],n,qwq[maxn];
int head[maxn],to[maxn<<1],nxt[maxn<<1],cnt = 0;
int read() {
	int ans = 0,f = 1;
	char c = getchar();
	while(c > '9' || c < '0') {if(c == '-') f = -1; c = getchar();}
	while(c <= '9' && c >= '0') {ans = (ans<<3)+(ans<<1)+c-'0'; c = getchar();}
	return ans*f;
}
void add(int u,int v) {
	cnt++;
	to[cnt] = v;
	nxt[cnt] = head[u];
	head[u] = cnt;
}
int sum = 0;
void dfs(int now,int pa) {
	siz[now] = 1;
	for(int i = head[now]; i; i = nxt[i]) {
		if(to[i] == pa) continue;
		dfs(to[i],now);
		(siz[now] += siz[to[i]]) %= mod;
		(qwq[now] += qwq[to[i]]) %= mod;
	}
	(qwq[now] += siz[now]) %= mod;
}
int su(int a,int b) {return ((a-b>=0)?(a-b):(a-b+mod));}
int ad(int a,int b) {return ((a+b<mod)?(a+b):(a+b-mod));}
void dfss(int now,int pa,int from) { //from is qwq[now] after changing root
	int ans = 0;
	for(int i = head[now]; i; i = nxt[i]) {
		if(to[i] == pa) continue;
		ans = (ans+qwq[to[i]]*su(n,siz[to[i]])%mod)%mod;
		dfss(to[i],now,ad(su(su(from,siz[to[i]]),siz[to[i]]),n));
	}
	//cout << ans << ' ' << from << ' ' << "j" << endl;
	if(now != 1) ans = (ans+su(su(from,su(qwq[now],siz[now])),n)*siz[now]%mod)%mod;
	sum = (sum+ans)%mod;
	//cout << now << ' ' << ans << endl;
}
signed main() {
	n = read();
	for(int i = 1; i <= n; i++) read();
	for(int i = 1; i < n; i++) {
		int u = read(),v = read();
		add(u,v),add(v,u);
	}
	dfs(1,0);
	dfss(1,0,qwq[1]);
	cout << (sum*inv2%mod);
	return 0;
}