// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define ull unsigned long long
#define i128 __int128
//#define int long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define mod 1000000007
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 300005
#define inf 0x3f3f3f3f

int n,m;
int col[maxn],wei[maxn];
vector<pii>e[maxn];

int fa[maxn],cc[maxn],cd[maxn],fw[maxn];
void dfs0(int u,int pa){
	for(auto [v,id]:e[u]){
		if(v==pa)continue;
		fa[v]=u,fw[v]=id;
		dfs0(v,u);
		cc[u]^=cc[v];
	}
	if(pa){
		if(col[fw[u]]!=cc[u]) cc[u]^=1,cd[u]=1;
	}
}

int V=10005;
int f[5005][20010],sz[maxn],ss[maxn],g[20010];
void dfs(int u){
	memset(f[u],63,sizeof f[u]);
	sz[u]=0;
	f[u][V]=0;
	for(auto [v,id]:e[u]){
		if(v==fa[u])continue;
		dfs(v);
		memset(g,63,sizeof g);
		For(i,-sz[u],sz[u]) if(f[u][i+V]<inf)
			For(j,-sz[v],sz[v]) if(f[v][j+V]<inf)
				g[i+j+V]=min(g[i+j+V],f[u][i+V]+f[v][j+V]);
		For(j,-sz[v],sz[v]) f[v][j+V]=inf;
		sz[u]+=sz[v];
		sz[u]=min(sz[u],10000);
		For(i,-sz[u],sz[u]) f[u][i+V]=g[i+V],g[i+V]=inf;
	}
	if(ss[u]){
		memset(g,63,sizeof g);
		For(i,-sz[u],sz[u]) g[i+V+ss[u]]=f[u][i+V];
		sz[u]+=ss[u];
		sz[u]=min(sz[u],10000);
		For(i,-sz[u],sz[u]) f[u][i+V]=g[i+V],g[i+V]=inf;
	}
	if(fa[u]){
		memset(g,63,sizeof g);
		int w=wei[fw[u]];
	//	cout<<"wei "<<u<<" "<<w<<"\n";
		if(cc[u]){
			For(i,-sz[u],sz[u]) g[i+V-1]=f[u][i+V];
		}else{
			For(i,-sz[u],sz[u]) g[i+V]=f[u][i+V];
		}
		++sz[u];
		sz[u]=min(sz[u],10000);
		Rep(i,sz[u],-sz[u]){
			if(i+2<=sz[u]) g[i+V]=min(g[i+V],g[i+V+2]);
			f[u][i+V]=inf;
			if(g[i+V]<inf) f[u][i+V]=g[i+V]+w*(i>0?i:-i);
		}
	}
//	cout<<"u: "<<u<<"\n";
//	For(i,-sz[u],sz[u]) cout<<f[u][i+V]<<" "; cout<<"\n";
}

void work()
{
	n=read(),m=read();
	For(i,1,n)e[i].clear(),cc[i]=fa[i]=fw[i]=ss[i]=cd[i]=0;
	For(i,2,n){
		int u=read(),v=read();
		wei[i]=read(),col[i]=read();
		e[u].pb(mkp(v,i));
		e[v].pb(mkp(u,i));
	}
	dfs0(1,0);
	For(i,1,n) cc[i]=cd[i];
	For(i,1,m){
		int x=read();
		++ss[x],cc[x]^=1;
	}
//	For(i,1,n)cout<<ss[i]<<" \n"[i==n];
//	For(i,1,n)cout<<cc[i]<<" \n"[i==n];
	dfs(1);
	int res=inf;
	For(i,0,sz[1]) res=min(res,f[1][i+V]);
	if(res==inf) res=-1;
	cout<<res<<"\n";
}

signed main()
{
//	cout<<5000*5000ll*10<<"\n";
//	freopen("data.in","r",stdin);
	memset(g,63,sizeof g);
	int T=read();
	while(T--)work();
	return 0;
}
/*

*/