#include<bits/stdc++.h>
#define ll long long
#define rg int
#define ci const int
#define ls x<<1
#define rs x<<1|1
#define mid ((l+r)>>1)
#define ld long double
#define fo(i,l,r) for(int i=(l);i<=(r);++i)
#define fd(i,l,r) for(int i=(l);i>=(r);--i)
#define fu(i,l,r) for(int i=(l);i<(r);++i)
#define gcd __gcd
#define P(x) __builtin_popcountll(x)
using namespace std;
ci N=1e6+5,M=5e3+5,mod=998244353,_g=3,_ig=(mod+1)/3;
ll ksm(ll a,ll b=mod-2)
{
	ll ans=1;
	while(b)
	{
		if(b&1)ans=(ll)ans*a%mod;
		a=(ll)a*a%mod,b>>=1;
	}
	return ans;
}
const ld eps=1e-10;
inline ll read(){ll u,f=1;char o;while((o=getchar())<48||o>57)if(o==45)f=-1;u=(o^48);while((o=getchar())>=48&&o<=57)u=(u<<1)+(u<<3)+(o^48);return u*f;}
void write(ll x){if(x<0)putchar(45),x=-x;if(x>9)write(x/10);putchar(x%10+48);}
mt19937 rad(chrono::steady_clock::now().time_since_epoch().count());
ll n,k,a[N],v[N],to[M][M],lca[N][20],ceng[N];
vector<ll>w[N];
bool f[N];
void tree(int x,int c)
{
	f[x]=1;
	ceng[x]=c;
//	cout<<x<<' '<<c<<'\n';
	for(auto d:w[x])if(!f[d])
	{
		lca[d][0]=x;
		int s=0;
		while(lca[lca[d][s]][s])
		{
			lca[d][s+1]=lca[lca[d][s]][s];
			++s; 
		}
		tree(d,c+1); 
	}
}
int find(int x,int y)
{//cout<<x<<' '<<y<<'\n';
	if(ceng[x]<ceng[y])swap(x,y);
	fd(i,19,0)if(ceng[x]-(1<<i)>=ceng[y])x=lca[x][i];
	fd(i,19,0)if(lca[x][i]!=lca[y][i])x=lca[x][i],y=lca[y][i];
	if(x!=y)x=lca[x][0];
//	cout<<x<<'\n';
	return x;
}
ll guess()
{
	ll f=1,ans=1;
	for(rg i=1;i<=k;++i)
	{
		if(to[i][i]==0)
		{
			for(rg j=i+1;j<=k;++j)if(to[j][i]!=0)
			{
				f=-f;
				swap(to[i],to[j]);
			}
		}
		ll inv=ksm(to[i][i],mod-2);
		for(rg j=i+1;j<=k;++j)
		{
			ll u=to[j][i]*inv%mod;
			for(rg o=i;o<=k;++o)to[j][o]=(to[j][o]-u*to[i][o])%mod;
		}
		ans=ans*to[i][i]%mod;
	}
	ans=ans*f;
	return (ans+mod)%mod;
}
int main()
{//freopen("1.in","r",stdin);
//	freopen("a.in","r",stdin);
//	freopen("a.out","w",stdout);
	int T=1;
	while(T--)
	{
		n=read();k=read();
		if(k>n)return 0*puts("0");
		fo(i,1,n)v[i]=read();
		fo(i,1,k)a[i]=read();
		fu(i,1,n)
		{
			ll x=read(),y=read();
			w[x].push_back(y);
			w[y].push_back(x);
		}
		tree(1,1);
		fo(i,1,k)fo(j,1,k)to[i][j]=v[find(a[i],a[j])];
	/*	fo(i,1,k)
		{
			fo(j,1,k)cout<<to[i][j]<<' ';
			cout<<'\n';
		}*/
		cout<<guess()<<'\n';
	}
	return 0;
}