#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/scc>
//#include <time.h> 
//using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;

#define all(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
template<class T>
bool chmax(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}
template<class T>
bool chmin(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}
void solve() {
    ll N, M;
    cin >> N >> M;
    
    vector<vector<pair<ll,ll>>> G(N);
    rep(i,M){
        ll U,V,W;
        cin>>U>>V>>W;
        U--;V--;
        G[U].push_back({W,V});
    }

    vb D(N,0);
    D[0]=1;
    priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>> Q;
    for(auto v:G[0]){
        Q.push(v);
    } 
    ll an=0;
    while(!Q.empty()){
        auto wn=Q.top();
        Q.pop();
        ll w=wn.first;
        ll n=wn.second;
        if(D[n])continue;
        an+=w;
        D[n]=1;
        for(auto k:G[n]){
            if(D[k.second])continue;
            Q.push(k);
        }
    }
    cout<<an<<endl;

}


int main() {

    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll T;
    cin >> T;
    rep(t, T)solve();

}