#include <bits/stdc++.h>

using i64 = long long;

constexpr int N = 5e3 + 5, S = 1e4, INF = (1 << 29);

int T, n, m, p[N], siz[N], f[N][N * 4], g[N * 4];
std::vector<std::array<int, 3>> G[N];

void chmin(int &x, int y) { if (y < x) x = y; }

void dfs(int u, int fa) {
    for (int i = -2 * n; i <= 2 * n; i++) f[u][i + S] = INF;
    for (int i = -n; i <= 0; i++) f[u][i + S] = 0;
    siz[u] = p[u] + 1;
    for (auto [v, w, c] : G[u]) if (v != fa) {
        dfs(v, u);
        for (int i = -siz[u] - siz[v]; i <= siz[u] + siz[v]; i++) g[i + S] = INF;
        for (int i = -siz[u]; i <= siz[u]; i++)
            for (int j = -siz[v]; j <= siz[v]; j++)
                if (c == (std::abs(j) & 1)) chmin(g[i + j + S], f[u][i + S] + f[v][j + S] + std::abs(j) * w);
        for (int i = -siz[u] - siz[v]; i <= siz[u] + siz[v]; i++) f[u][i + S] = g[i + S];
        siz[u] += siz[v];
    }
    for (int i = siz[u]; i >= -siz[u]; i--) f[u][i + S] = f[u][i - p[u] + S];
}

void solve() {
    std::cin >> n >> m;
    for (int i = 1; i <= n; i++) p[i] = 0, G[i].clear();
    for (int i = 1; i < n; i++) {
        int u, v, w, c; std::cin >> u >> v >> w >> c;
        G[u].push_back({v, w, c});
        G[v].push_back({u, w, c});
    }
    for (int i = 1, x; i <= m; i++) std::cin >> x, p[x]++;
    dfs(1, 0); std::cout << (f[1][S] == INF ? -1 : f[1][S]) << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    std::cin >> T;
    while (T--) solve();

    return 0;
}