#include<bits/stdc++.h>
using namespace std;
const long long mod=1e9+7;
long long T,a,b,c,d[1000001],v[1000001],o,h[1000001],fa[1000001],q,w,e,an,cn,fac[1000001],inv[1000001],st[1000001],u[1000001],e1,e2,dp[5001][10001],lim=5000,inf=1e12,ls[1000001];
long long y[1000001];
int si[1000001],si1[1000001],sm[1000001];
char s[1000001];
struct p{long long q,w,e;}l[1000001];
long long pow_(long long qq,long long ww){long long ee=1;while(ww){if(ww&1) ee*=qq,ee%=mod;qq*=qq,qq%=mod,ww>>=1;}return ee%mod;}
inline int read(){int x=0,f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}return x*f;}
void add(long long qq,long long ww){l[++o].q=ww,l[o].w=h[qq],h[qq]=o;}
long long gcd(long long qq,long long ww){return !ww?qq:gcd(ww,qq%ww);}
long long find(long long qq){return qq==fa[qq]?qq:fa[qq]=find(fa[qq]);}
void merge(long long qq,long long ww){long long f1=find(qq),f2=find(ww);if(f1==f2) return;fa[f1]=f2;}
long long C(long long qq,long long ww){return fac[qq]*inv[ww]%mod*inv[qq-ww]%mod;}
vector<p> qu[1000001];
void dfs(int qq,int ww)
{
	sm[qq]=0;si[qq]=si1[qq]=0;
	for(int i=0;i<qu[qq].size();i++)
	{
		if(qu[qq][i].q==ww) continue;
		fa[qu[qq][i].q]=qu[qq][i].w;
		y[qu[qq][i].q]=qu[qq][i].e;
		dfs(qu[qq][i].q,qq);
		sm[qq]^=sm[qu[qq][i].q];
		si[qq]+=si[qu[qq][i].q];
		si1[qq]+=si1[qu[qq][i].q];
	}
	sm[qq]^=y[qq];
	si[qq]+=sm[qq];
	si1[qq]+=v[qq];
}
void dfs2(int qq,int ww)
{
	si[qq]=si1[qq]=0;
	si[qq]++;
	si1[qq]+=v[qq];
	for(int j=0;j<=v[qq];j++) dp[qq][lim+j]=0;
	for(int i=0;i<qu[qq].size();i++)
	{
		if(qu[qq][i].q==ww) continue;
		dfs2(qu[qq][i].q,qq);
		for(int j=lim-si[qq];j<=lim+si1[qq];j++) ls[j]=dp[qq][j],dp[qq][j]=inf;
		for(int j=lim-si[qq];j<=lim+si1[qq];j++)
		{
			for(int k=lim-si[qu[qq][i].q];k<=lim+si1[qu[qq][i].q];k++)
			{
				dp[qq][j+k-lim]=min(dp[qq][j+k-lim],ls[j]+dp[qu[qq][i].q][k]);
			}
		}
		si[qq]+=si[qu[qq][i].q];
		si1[qq]+=si1[qu[qq][i].q];
	}
	for(int i=lim-1;i>=lim-si[qq];i--) dp[qq][i]=min(dp[qq][i],dp[qq][i+1]);
	if(qq!=1)
	{
		for(int i=lim-si[qq];i<=lim+si1[qq];i++)
		{
			if(i%2!=y[qq]) dp[qq][i]=inf;
			else dp[qq][i]+=(long long)(abs(i-lim))*fa[qq];
//			cout<<qq<<" "<<i-lim<<" "<<dp[qq][i]<<" "<<y[qq]<<"\n";
		}
	}
}
int main()
{
//	freopen("1.in","r",stdin);
	srand((unsigned)(time(0)^(*new int)));
	fac[0]=1;for(int i=1;i<=1000000;i++) fac[i]=fac[i-1]*i%mod;
	inv[1000000]=pow_(fac[1000000],mod-2);for(int i=999999;i>=0;i--) inv[i]=inv[i+1]*(i+1)%mod;
	T=1;
	scanf("%lld",&T);
	for(int ii=1;ii<=T;ii++)
	{
		scanf("%lld%lld",&a,&b);
		for(int i=1;i<=a;i++)
		{
			for(int j=lim-max(a,b);j<=lim+max(a,b);j++) dp[i][j]=inf;
		}
		for(int i=1;i<=a;i++) qu[i].clear(),v[i]=0;
		for(int i=1;i<a;i++)
		{	
			scanf("%lld%lld%lld%lld",&q,&w,&e1,&e2);
			if(ii==8) cout<<q<<" "<<w<<" "<<e1<<" "<<e2<<"\n";
			qu[q].push_back(p{w,e1,e2});
			qu[w].push_back(p{q,e1,e2}); 
		}
		for(int i=1;i<=b;i++) d[i]=read(),v[d[i]]++;
		if(ii==8)
		{
			for(int i=1;i<=b;i++) cout<<d[i]<<" ";cout<<"\n";
		}
		dfs(1,0);sm[1]=0;
		dfs2(1,0);
		if(dp[1][lim]>=1e9) printf("-1\n");
		else printf("%lld\n",dp[1][lim]);
	}
	return 0;
}