#include <bits/stdc++.h>
#define ll long long
#define pii pair <int, int>
#define fi first
#define se second
#define pb push_back
#define int long long
#define lowbit(x) x&-x

using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N = 5e5+5, mod = 998244353; 
int n, v[N], vis[N], dfn[N], sz[N], a[N], dt, ld[N], rd[N], k; 
vector <int> e[N];

ll qpow (ll x, ll y = mod-2) {
	ll res = 1;
	while (y) {
		if (y&1) res = res*x%mod;
		x = x*x%mod; y >>= 1;
	}
	return res; 
}
void dfs (int p, int fa) {
	sz[p] = vis[p]; 
	for (int i : e[p]) {
		if (i == fa) continue; 
		dfs(i, p); sz[p] += sz[i]; 
	}
}
void tdfs (int p, int fa) {
	ld[p] = dt+1;
	if (vis[p]) dfn[p] = ++dt; 
	for (int i : e[p]) {	
		if (i == fa) continue; 
		tdfs(i, p); 
	} 
	rd[p] = dt; 
}
int s[N*4], ml[N*4]; 
inline void push_up (int p) { s[p] = (s[p<<1]+s[p<<1|1])%mod; }
inline void upd (int p, int k) { s[p] = s[p]*k%mod; ml[p] = ml[p]*k%mod; }
inline void push_down (int p) {
	upd(p<<1, ml[p]); upd(p<<1|1, ml[p]); 
	ml[p] = 1; 
}
void build (int p, int l, int r) {
	ml[p] = 1; 
	if (l == r) return s[p] = 1, void(); 
	int mid = l+r>>1; 
	build(p<<1, l, mid); build(p<<1|1, mid+1, r); 
	push_up(p); 
}
void cmul (int p, int l, int r, int tl, int tr, int k) {
	if (tl > tr) return; 
	if (tl <= l && r <= tr) return upd(p, k); 
	int mid = l+r>>1; push_down(p); 
	if (tl <= mid) cmul(p<<1, l, mid, tl, tr, k); 
	if (tr > mid) cmul(p<<1|1, mid+1, r, tl, tr, k); 
	push_up(p); 
}
ll qsum (int p, int l, int r, int tl, int tr) {
	if (tl <= l && r <= tr) return s[p]; 
	int mid = l+r>>1, res = 0; push_down(p); 
	if (tl <= mid) res += qsum(p<<1, l, mid, tl, tr); 
	if (tr > mid) res += qsum(p<<1|1, mid+1, r, tl, tr); 
	return res; 
}
	
ll ans = 1; 
ll f[N], g[N], tmp[N], td[N]; 
void dfs2 (int p, int fa, int w) {
	if (vis[p]) {
		g[dfn[p]] = (v[p]+w)%mod;
		ans = ans*(v[p]+w)%mod; 
		cmul(1, 1, k, dfn[p], dfn[p], qpow(g[dfn[p]])); 
		for (int j : e[p]) {
			if (j == fa || !sz[j]) continue; 
			dfs2(j, p, -v[p]);  
		}
		cmul(1, 1, k, ld[p]+1, rd[p], 0); 
		return; 
	}
	ll s = 0; 
	for (int i : e[p]) {
		if (i == fa || !sz[i]) continue;
		dfs2(i, p, w);  
		tmp[i] = (1-s)%mod; 
		td[i] = (v[p]+w)%mod; 
		ll sv = qsum(1, 1, k, ld[i], rd[i])*td[i]%mod;
		(w -= (v[p]+w)%mod*sv) %= mod; (s += sv*tmp[i]) %= mod; 
	}
	ll st = 0; 
	for (int I = 1l*e[p].size()-1; ~I; I--) {
		int i = e[p][I]; 
		if (i == fa || !sz[i]) continue; 
		cmul(1, 1, k, ld[i], rd[i], (tmp[i]-st*td[i])%mod); 
		(st += qsum(1, 1, k, ld[i], rd[i])) %= mod; 
//		for (int j = ld[i];j <= rd[i];j++) (st += qpow(g[j])*sk[j]) %= mod; 
	}
}

void solve () {
	cin >> n >> k; 
	for (int i = 1;i <= n;i++) cin >> v[i]; 
	for (int i = 1;i <= k;i++) {
		cin >> a[i]; 
		if (vis[a[i]]) {
			cout << "0"; return; 
		}
		vis[a[i]] = 1; 
	}
	build(1, 1, k); 
	for (int i = 1;i < n;i++) {
		int x, y; cin >> x >> y; 
		e[x].pb(y); e[y].pb(x); 
	}
	dfs(1, 0); tdfs(1, 0); 
	dfs2(1, 0, 0);  
	if (ans < 0) ans += mod; 
	cout << ans;
}

signed main () {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int T = 1;
	while (T--) solve();
	return 0;
}