#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
const int N=1e5+10;
int n,m,inv[N],jc[N];
#define pi pair<int,int>
#define fi first
#define se second
#define pb push_back
vector<pi>g[N];
int ans,su[N];
bool vis[N];
void ad(int &x,int y){
	x+=y;if(x>=mod)x-=mod;
}
void dfs(int x,int f){
	int P=inv[g[x].size()-1];
	for(pi e:g[x]){
		int v=e.fi,w=e.se;if(v==f)continue;
		dfs(v,x);
		if(vis[w])ad(ans,mod-su[v]),su[v]=1;
		ad(ans,mod-1ll*su[x]*su[v]%mod*P%mod),ad(su[x],su[v]);
	}
	su[x]=1ll*su[x]*P%mod;
}
void rd(int &x){
	x=0;char c=getchar();
	while(c<'0'||c>'9')c=getchar();
	while(c>='0'&&c<='9')x=x*10+c-'0',c=getchar();
}
void wrt(int x){
	if(x<10){putchar(x+'0');return;}
	wrt(x/10),putchar((x%10)+'0');
}
void sol(){
	rd(n),rd(m);inv[1]=1;
	for(int i=2;i<=n;i++)inv[i]=mod-1ll*inv[mod%i]*(mod/i)%mod;
	jc[0]=1;for(int i=1;i<=n;i++)jc[i]=1ll*i*jc[i-1]%mod,su[i]=0,g[i].clear(),vis[i]=0;
	for(int i=1,u,v;i<n;i++)rd(u),rd(v),g[u].pb({v,i}),g[v].pb({u,i});
	for(int i=1,x;i<=m;i++)rd(x),vis[x]=1;
	int A=1;
	for(int i=1;i<=n;i++){
		int sz=g[i].size();
		A=1ll*A*jc[sz-1]%mod;
	}
	ans=m;
	dfs(1,0);
	wrt((1ll*ans*A%mod+mod)%mod);putchar('\n');
}
int main(){
	freopen("traverse.in","r",stdin);
	freopen("traverse.out","w",stdout);
	int typ,T;
	rd(typ),rd(T);while(T--)sol();
	return 0;
}