#include <iostream>

#include <cstring>

#include <cstdio>

#include <algorithm>

#include <cstdlib>

#include <cstring>

#include <cassert>

#define inf 0X3f3f3f3f

#define OPENSTACK

using namespace std;

const int M = 1e5 + ;

typedef long long ll;

struct TnT {

    int v , next , w;

}edge[M << ];

struct GBA {

    ll val , pos;

    int num;

}GG[M];

int e , head[M] , n , k , in[M] , cnt;

ll c[M];

bool cmp(GBA x , GBA y) {

    return x.num > y.num;

}

void init() {

    e = , cnt = ;

    memset(head , - , sizeof(head));

    memset(in ,  , sizeof(in));

}

void add(int u , int v , int w) {

    edge[e].v = v;

    edge[e].w = w;

    edge[e].next = head[u];

    head[u] = e++;

}

ll dfs(int u , int pre) {

    ll sum = ;

    for(int i = head[u] ; i != - ; i = edge[i].next) {

        int v = edge[i].v;

        if(v == pre) continue;

        ll ans = dfs(v , u);

        GG[cnt].num = min(ans , (ll)n - ans), GG[cnt++].val = edge[i].w;

        sum += ans;

    }

    return sum;

}

int main() {

#ifdef OPENSTACK

    int size =  << ; // 64MB

    char *p = (char*)malloc(size) + size;

#if (defined _WIN64) or (defined __unix)

    __asm__("movq %0, %%rsp\n" :: "r"(p));

#else

    __asm__("movl %0, %%esp\n" :: "r"(p));

#endif

#endif

    int t;

    scanf("%d" , &t);

    while(t--) {

        scanf("%d%d" , &n , &k);

        init();

        for(int i =  ; i < n ; i++) {

            int u , v , w;

            scanf("%d%d%d" , &u , &v , &w);

            add(u , v , w);

            add(v , u , w);

            in[u]++, in[v]++;

        }

        for(int i =  ; i < k ; i++) scanf("%lld" , &c[i]);

        for(int i =  ; i <= n ; i++) {

            if(in[i] == ) {

                dfs(i , -);

                break;

            }

        }

        sort(GG , GG + n , cmp);

        sort(c , c + k);

        reverse(c , c + k);

        ll ans = ;

        for(int i =  ; i < k ; i++) {

            ans += GG[i].num * (GG[i].val + c[i]);

        }

        for(int i = k ; i < cnt ; i++) ans += GG[i].num * GG[i].val;

        printf("%lld\n" , ans);

    }

#ifdef OPENSTACK

    exit();

#else

    return ;

#endif

}