#include<bits/stdc++.h> using namespace std; const int N=5050,mod=998244353; bool mk[N];int n; vector<int> E[N]; inline void plu(int &a,int b){ a+=b;if(a>=mod) a-=mod; }inline void mult(int &a,int b){ a=1ll*a*b%mod; }int f[N];bool vis[N]; int g[N],h[N]; inline void dfs(int u,int fa){ int cnt=0;vis[u]=1; g[u]=1,h[u]=0; for(auto v:E[u]){ if(v==fa) continue; if(!mk[v]){ plu(h[u],h[u]); plu(h[u],g[u]); plu(g[u],g[u]); }else{ dfs(v,u); mult(h[u],(2*h[v]+g[v])%mod); plu(h[u],1ll*g[u]*h[v]%mod); mult(g[u],(1ll*g[v]+1ll*2*h[v])%mod); //plu(cnt,dfs1(v,u)); } }//f[u]=cnt; //cout<<u<<' '<<f[u]<<endl; //return cnt; }int tmp=0;int pw2[N]; int ans=0; int main(){ cin>>n; for(int i=1;i<n;i++){ int u,v;cin>>u>>v; E[u].push_back(v); E[v].push_back(u); }pw2[0]=1; for(int i=1;i<=n;i++) pw2[i]=1ll*pw2[i-1]*2%mod; for(int i=1;i<n;i++){ int x;cin>>x;mk[x]=1; memset(f,0,sizeof(f));memset(vis,0,sizeof(vis)); ans=1; for(int j=1;j<=n;j++){ //cout<<mk[j]<<' '; if(!vis[j]&&mk[j]){ //tmp=dfs(j,0); int now=/*1ll*tmp*g2(tmp-1)*/0; //plu(now,dfs1(j,j)); dfs(j,j);plu(now,(h[j])%mod); //cout<<tmp<<' '<<now<<' '; mult(ans,now); //cout<<endl<<"============"<<endl; } }cout<<ans<<endl; } return 0; }