// 用的Kruskal构造最小生成树，应该是很简单的，但就是WA
#include <stdio.h>
typedef struct {
    int x;
    int y;
    int d;
} Rel;

int cmp(const void* r1, const void* r2) { return ((*(Rel *)r2).d)-((*(Rel *)r1).d); }

int main()
{
    int t, i, n, m, r;
    int cost;
    int used_x[10000], used_y[10000];
    Rel rels[50000];
    scanf("%d", &t);
    while(t--)
    {
	memset(used_x, 0, sizeof(used_x));
	memset(used_y, 0, sizeof(used_y));
	scanf("%d %d %d", &n, &m, &r);
	for(i = 0; i != r; ++i)
	    scanf("%d %d %d", &(rels[i].x), &(rels[i].y), &(rels[i].d));
	cost = (n+m)*10000;
	qsort(rels, r, sizeof(rels[0]), cmp);
	for(i = 0; i != r; ++i)
	{
	    if((used_x[rels[i].x]+used_y[rels[i].y]) < 2)
	    {
		used_x[rels[i].x] = 1;
		used_y[rels[i].y] = 1;
		cost -= rels[i].d;
	    }
	}
	printf("%d\n", cost);
    } 
    return 0;
}