#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long 
#define vi vector < int > 
#define sz(a) ((int) (a).size())
#define ll long long 
#define ull unsigned long long
#define me(a, x) memset(a, x, sizeof(a)) 
using namespace std;
const int N = 1 << 19;
int n, m;
int col[N];

struct edge{
	int v, w, c;
};
int cnt[N];
vector < edge > e[N];

int sum[N];
void dfs2(int x, int fa) {
	sum[x] = cnt[x] - col[x]; 
	for(auto to : e[x]) if(to.v != fa) {
		int v = to.v;
		dfs2(v, x);
		sum[x] += sum[v];
	}
}

ll ans;
void dfs3(int x, int fa) { 
	for(auto to : e[x]) if(to.v != fa) {
		int v = to.v;
		int A = sum[1] - sum[v];
		int B = sum[v];
		if(A >= 0 && B >= 0) {
			ans += (A & 1) * to.w;
		} else {
			ans += (ll) min(abs(A), abs(B)) * to.w;
		}
		dfs3(v, x);
	}
}

void Main() {
	cin >> n >> m;
	L(i, 1, n - 1) {
		int u, v;
		edge nd;
		cin >> u >> v >> nd.w >> nd.c;
		col[u] ^= nd.c;
		col[v] ^= nd.c;
		nd.v = v, e[u].emplace_back(nd);
		nd.v = u, e[v].emplace_back(nd);
	}
	L(i, 1, m) {
		int p;
		cin >> p;
		col[p] ^= 1;
		++cnt[p];
	}
	int cols = 0;
	L(i, 1, n) {
		cols += col[i];
	}
	if(cols > m || ((m - cols) & 1)) {
		cout << "-1\n";
	} else {
		ans = 0;
		dfs2(1, 0);
		dfs3(1, 0);
		cout << ans << '\n';
	}
	
	L(i, 1, n) {
		e[i].clear();
		cnt[i] = 0;
		col[i] = 0;
		sum[i] = 0;
	}
}

int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int t; cin >> t; while(t--) Main();
	return 0;
}