#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <queue>
#include <ctime>
#include<functional>
using namespace std;
#define LL long long
const int N = 2000;
const int INF = 0x3f3f3f;
struct Node
{
    int to,next,w;
    bool operator < (const Node &a) const
    {
        return w > a.w;
    }
} Edge[20000],t1,t2;
int dis[N],vis[N],head[N],cnt;
int res;
void addedge(int u,int v,int w)
{
    Edge[cnt].to= v;
    Edge[cnt].next = head[u];
    Edge[cnt].w = w;
    head[u] = cnt++;
}
void init()
{
        //memset(Edge,0,sizeof(Edge));
        memset(head,-1,sizeof(head));
        memset(vis,0,sizeof(vis));
        memset(dis,INF,sizeof(dis));
        res=0;
        cnt=0;
}
void prim(int s)
{
    priority_queue<Node> q;
    for(int i = head[s] ; i != -1 ; i = Edge[i].next)
    {
        int v = Edge[i].to;
        if(Edge[i].w < dis[v])
        {
            dis[v] = Edge[i].w;
            t1.w = dis[v];
            t1.to =  v;
            q.push(t1);
        }
    }
    vis[s] = 1;
    // printf("u:%d dis:%d\n",s,dis[s]);
    while(!q.empty())
    {
        t1 = q.top();
        q.pop();
        int u = t1.to;
        if(vis[u]) continue;
        vis[u] = 1;
       // printf("u:%d dis:%d\n",u,dis[u]);
        res += dis[u];
        for(int i = head[u]; i != -1; i = Edge[i].next)
        {
            int v = Edge[i].to;
            if(!vis[v] && dis[v] > Edge[i].w)
            {
                dis[v] = Edge[i].w;
                t2.to = v;
                t2.w = dis[v];
                q.push(t2);
            }
        }
    }
}
int main()
{
    int t, n,m,r,w,a,b;
    scanf("%d",&t);
    while(t--)
    {

        res=0;
         scanf("%d%d%d",&n,&m,&r);
        init();
        for(int i=0; i<r; i++)
        {
            scanf("%d%d%d",&a,&b,&w);


           /* if(a==b){
                res-=w;
                continue;
            }*/
            addedge(a,b,w);
            addedge(b,a,w);
        }
        for(int i=0;i<n;i++)
            if(!vis[i])
                prim(i);
        //printf("%d\n",res);
        printf("%d\n",res);
    }
    return 0;
}
/*
45
8 8 16
4 5 35
4 7 37
5 7 28
0 7 16
1 5 32
0 4 38
2 3 17
1 7 19
0 2 26
1 3 29
2 7 34
6 2 40
3 6 52
6 0 58
6 4 93
1 2 36

outPut:181
*/