/*  Erica N  */
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define int long long
#define ull unsigned long long
#define pii pair<int, int>
#define ps second
#define pf first
#define itn int
#define rd read()
int read(){
    int xx = 0, ff = 1;char ch = getchar();
    while (ch < '0' || ch > '9') {if (ch == '-')ff = -1; ch = getchar();}
    while (ch >= '0' && ch <= '9')xx = xx * 10 + (ch - '0'), ch = getchar();
    return xx * ff;
}
// void write(int out) {
// 	if (out < 0)
// 		putchar('-'), out = -out;
// 	if (out > 9)
// 		write(out / 10);
// 	putchar(out % 10 + '0');
// }
#define cdbg(x...) do { cerr << #x << " -> "; err(x); } while (0)
void err() { cerr << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cerr << v << ' '; err(x...); }
template<typename T, typename... A>
void err(T a, A... x) { cerr << a << ' '; err(x...); }


const int N = 3e5 + 5;
const int INF = 1e18;
const int M = 1e7;
const int MOD = 1e9 + 7;



struct Node{
    int a,b,w;

}t[N];

bool cmp(Node a,Node b){
    return a.w<b.w;
}

bitset<N> used;
int fa[N];
int ans;
int m,n;
int find(int a){
    if(fa[a]==a)return a;
    return fa[a]=find(fa[a]);
}

void kruskal(){
    for(int i=1;i<=m;i++){
        int faa=find(t[i].a);
        int fbb=find(t[i].b);
        if(faa==fbb)continue;
        fa[faa]=fbb;
        used[i]=1;

    }
}

int sz[N];


void solve(){
     n=rd,m=rd;
     ans=0;
     
    for(int i=1;i<=m;i++){
        t[i]={rd,rd,rd};
        used[i]=0;
    }


    sort(t+1,t+m+1,cmp);
    for(int i=1;i<=n;i++){
        fa[i]=i;
    }


    kruskal();


    for(int i=1;i<=n;i++){
        fa[i]=i;
        sz[i]=1;
    }

    for(int i=1;i<=m;i++){
        if(!used[i])continue;
        int faa=find(t[i].a);
        int fbb=find(t[i].b);
        ans+=t[i].w*(sz[faa]*sz[fbb]);
        sz[fbb]+=sz[faa];
        fa[faa]=fbb;
    }

    cout<<ans<<endl;


}

signed main() {
    // freopen(".in","r",stdin);
    // freopen(".out","w",stdout);
    int t=rd;
    while(t--){
        solve();
    }


}