#include<bits/stdc++.h>
using namespace std;
const int N=5010;
const int INF=1e9;
int T,n,m,x,y;
int l[N],col[N],sum[N],dp[N][N<<1],sz[N],s[N],f[N<<1];
int q[N<<1];
vector<pair<int,int>>e[N];
void dfs(int x,int y,int z,int w){
	sz[x]=1;s[x]=0;
	dp[x][m]=0;
	for (int i=0;i<e[x].size();i++){
		int u=e[x][i].first;
		int id=e[x][i].second;
		if (u==y) continue;
		dfs(u,x,l[id],col[id]);
		for (int j=m-s[x]-s[u];j<=m+sz[x]+sz[u];j++) f[j]=INF;
		for (int j=-s[x];j<=sz[x];j++)
			for (int k=-s[u];k<=sz[u];k++)
				f[j+k+m]=min(f[j+k+m],dp[x][j+m]+dp[u][k+m]);
		for (int j=m-s[x]-s[u];j<=m+sz[x]+sz[u];j++) dp[x][j]=f[j];
		sz[x]+=sz[u];
		s[x]+=s[u];
	}
	for (int j=m-s[x]-sum[x];j<=m+sz[x];j++) f[j]=INF;
	int l=1,r=0;
	for (int j=m+sz[x];j>=m-s[x]-sum[x];j--){
		q[++r]=j;
		while (r>l&&dp[x][q[r]]<=dp[x][q[r-1]]){
			r--; q[r]=j;
		}
		while (l<=r&&q[l]>j+sum[x]) l++;
		f[j]=dp[x][q[l]];
	}
	for (int j=m+1;j<=m+sz[x];j++) f[j]=min(f[j-1],f[j]);
	for (int j=m-s[x]-sum[x];j<=m+sz[x];j++) dp[x][j]=f[j];
	for (int j=m-s[x]-sum[x];j<=m+sz[x];j++) 
		if (dp[x][j]!=INF) dp[x][j]=min(INF,abs(j-m)*z+dp[x][j]);
	for (int j=m-s[x]-sum[x];j<=m+sz[x];j++)
		if ((abs(j-m)&1)!=w) dp[x][j]=INF;
	s[x]+=sum[x];
}
int main(){
	scanf("%d",&T);
	while (T--){
		scanf("%d%d",&n,&m);
		for (int i=1;i<=n;i++) e[i].clear(),sum[i]=0;
		for (int i=1;i<=n;i++)
			for (int j=0;j<=n+m;j++) dp[i][j]=INF;
		for (int i=1;i<n;i++){
			scanf("%d%d%d%d",&x,&y,&l[i],&col[i]);
			e[x].push_back(make_pair(y,i));
			e[y].push_back(make_pair(x,i));
		}
		for (int i=1;i<=m;i++){
			scanf("%d",&x); sum[x]++;
		}
		dfs(1,0,0,0);
		if (dp[1][m]==INF) puts("-1");
		else
		printf("%d\n",dp[1][m]);
	}
}