#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e5+10;
typedef long long ll;
ll siz[MAXN];
int fa[MAXN];
int n,m;
struct node{
	int u,v;ll w;
	bool operator<(const node x)const{
		return w<x.w;
	}
};
vector<node>e;
int find(int x){
	if(fa[x]!=x)fa[x]=find(fa[x]);
	return fa[x];
}
ll merge(int x,int y){
	int fx=find(x),fy=find(y);
	if(fx==fy)return 0;
	ll re=siz[fx]*siz[fy];
	siz[fx]+=siz[fy];fa[fy]=fx;
	return re;
}
void solve(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;++i)siz[i]=1,fa[i]=i;
	for(int i=1;i<=m;++i){
		node x;scanf("%d%d%lld",&x.u,&x.v,&x.w);
		e.push_back(x);
	}ll ans=0;
	sort(e.begin(),e.end());
	for(node x:e){
		ans+=merge(x.u,x.v)*x.w;
	}
	printf("%lld\n",ans);
	e.clear();
}
int main(){
	int T;scanf("%d",&T);
	while(T--)solve();
	return 0;
}