#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

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]; 
	}
	sort(e[p].begin(), e[p].end(), [&](int x, int y) { return sz[x] < sz[y]; });
}
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; 
}
ll ans = 1; 
ll sk[5005][5005], f[N], g[N], sg[5005][5005]; 
ll td[N]; 
void dfs2 (int p, int fa, int k) {
	if (vis[p]) {
//		cout << p << " " << v[p] << " " << k << endl; 	
		g[dfn[p]] = sg[dfn[p]][dfn[p]] = (v[p]+k)%mod;
		for (int j = dfn[p];j <= rd[p];j++) sg[dfn[p]][j] = (v[p]+k)%mod; 
		ans = ans*(v[p]+k)%mod; 
//		cout << "SK:\n"; 
//		cout << sz[p] << endl; 
////		for (int j = dfn[p];j <= dfn[p]+sz[p]-1;j++) cout << sk[p][j] << " "; cout << endl; 
		for (int j = dfn[p]+1;j <= dfn[p]+sz[p]-1;j++) (sk[p][j] -= sk[p][dfn[p]]) %= mod; 
		for (int j : e[p]) {
			if (j == fa || !sz[j]) continue; 
//			cout << "CHJONSLKJF:" << j << " " << sz[j] << endl; 
			for (int i = ld[j];i <= rd[j];i++) sk[j][i] = 1; //sk[p][i]; 
			dfs2(j, p, -v[p]);  
//			cout << "CHECK:" << p << " " << j << " " << ld[j] << endl; 
			for (int i = ld[j];i <= rd[j];i++) sk[p][i] = 0; //tmp*sk[j][i]%mod;
		}
		return; 
	}
	ll s = 0; 
	for (int i : e[p]) {
		if (i == fa || !sz[i]) continue; 
		for (int j = ld[i];j <= rd[i];j++) sk[i][j] = 1;// (sk[i][j] = sk[p][j]-s) %= mod;
		dfs2(i, p, k);  
		int tmp = (1-s)%mod; 
		for (int j = ld[i];j <= rd[i];j++) assert(sk[p][j] == sk[p][ld[i]]); 
		for (int j = ld[i];j <= rd[i];j++) sk[p][j] = tmp*sk[i][j]%mod; 
		for (int j = ld[i];j <= rd[i];j++) for (int z = rd[i]+1;z <= rd[p];z++) sg[j][z] = sk[p][j]*(v[p]+k)%mod; 
		
		for (int j = ld[i];j <= rd[i];j++) td[j] = (v[p]+k)%mod; 
		ll tk = k; 
		for (int j = ld[i];j <= rd[i];j++) {
			ll sv = qpow(g[j])*td[j]%mod; 
//			cout << p << " " << i << " " << sv << " " << td[j] << " " << g[j] << " " << j << endl; 
			(k -= (v[p]+tk)%mod*sv%mod) %= mod; (s += sv*sk[p][j]%mod) %= mod; 
			for (int z = j;z <= rd[i];z++) (td[z] -= sv*sg[j][z]%mod) %= mod; 
			assert(td[j] == 0); 
		}
	}
	
}

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; sk[1][i] = 1; 
	}
	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;
}