#include <iostream>
#include <vector>
#include <functional>
using i64 = long long;
constexpr int MOD = 998244353;

template<class Monoid> struct ReRooting {
	using Graph = std::vector<std::vector<int>>;
	using MergeFunc = std::function<Monoid(Monoid, Monoid)>;
	using AddNodeFunc = std::function<Monoid(int, Monoid)>;

	Graph G;
	Monoid IDE;
	MergeFunc MERGE;
	AddNodeFunc ADDNODE;

	std::vector<std::vector<Monoid>> dp;

	ReRooting() {}
	ReRooting(const Graph &g, const Monoid &ide, \
			  const MergeFunc &merge, const AddNodeFunc &addnode) {
		G = g;
		IDE = ide;
		MERGE = merge;
		ADDNODE = addnode;
		build();
	}

	Monoid rec(int v, int p) {
		Monoid res = IDE;
		dp[v].assign(G[v].size(), IDE);
		for(int i=0;i<G[v].size();++i) {
			int v2 = G[v][i];
			if(v2 == p) continue;
			dp[v][i] = rec(v2, v);
			res = MERGE(res, dp[v][i]);
		}
		return ADDNODE(v, res);
	}

	void rerec(int v, int p, Monoid pval) {
		for(int i=0;i<G[v].size();++i) {
			int v2 = G[v][i];
			if(v2 == p) {
				dp[v][i] = pval;
				continue;
			}
		}
		std::vector<Monoid> left(G[v].size() + 1, IDE);
		std::vector<Monoid> right(G[v].size() + 1, IDE);

		for(int i=0;i<G[v].size();++i) {
			left[i+1] = MERGE(left[i], dp[v][i]);
			right[i+1] = MERGE(right[i], dp[v][(int)G[v].size() - i - 1]);
		}
		for(int i=0;i<G[v].size();++i) {
			int v2 = G[v][i];
			if(v2 == p) continue;
			Monoid pval2 = MERGE(left[i], right[(int)G[v].size() - i - 1]);
			rerec(v2, v, ADDNODE(v, pval2));
		}
	}

	void build() {
		dp.assign(G.size(), std::vector<Monoid>());
		int root = 0, nullparent = -1;
		rec(root, nullparent);
		rerec(root, nullparent, IDE);
	}

	Monoid get(int v) {
		Monoid res = IDE;
		for(int i=0;i<G[v].size();++i) {
			res = MERGE(res, dp[v][i]);
		}
		return ADDNODE(v, res);
	}
};

int powmod(int n, int k) {
	// using constexpr MOD
	if(k == 0) return 1;
	if(k == 1) return n;
	i64 half = powmod(n, k>>1);
	if(k&1) return (((half * half) % MOD) * n) % MOD;
	return (half * half) % MOD;
}

int main() {
	int N;
	std::cin >> N;
	
	std::vector<int> A(N);
	for(int i=0;i<N;++i) std::cin >> A[i];

	std::vector<std::vector<int>> G(N, std::vector<int>());
	for(int i=0;i<N-1;++i) {
		int u, v;
		std::cin >> u >> v;
		u--;v--;
		G[u].push_back(v);
		G[v].push_back(u);
	}
	
	auto merge = [&](i64 a, i64 b) {
		return (a + b) % MOD;
	};

	auto add = [&](int v, i64 a) {
		return ((a + 1) * A[v]) % MOD;
	};

	i64 identity = 0;

	ReRooting<i64> rr(G, identity, merge, add);
	i64 ans = 0;

	for(int v=0;v<N;++v) {
		ans += rr.get(v);
		ans %= MOD;
	}
	
	for(int i=0;i<N;++i) {
		ans += (MOD - A[i]);
		ans %= MOD;
	}
	std::cout << ((i64)ans * powmod(2, MOD-2)) % MOD << std::endl;
}