#include <bits/stdc++.h>
using namespace std;

#include <algorithm>

#include <algorithm>
#include <utility>
#include <vector>

namespace atcoder {
namespace internal {

template <class E> struct csr {
    std::vector<int> start;
    std::vector<E> elist;
    csr(int n, const std::vector<std::pair<int, E>>& edges)
        : start(n + 1), elist(edges.size()) {
        for (auto e : edges) {
            start[e.first + 1]++;
        }
        for (int i = 1; i <= n; i++) {
            start[i] += start[i - 1];
        }
        auto counter = start;
        for (auto e : edges) {
            elist[counter[e.first]++] = e.second;
        }
    }
};

// Reference:
// R. Tarjan,
// Depth-First Search and Linear Graph Algorithms
struct scc_graph {
  public:
    scc_graph(int n) : _n(n) {}

    int num_vertices() { return _n; }

    void add_edge(int from, int to) { edges.push_back({from, {to}}); }

    // @return pair of (# of scc, scc id)
    std::pair<int, std::vector<int>> scc_ids() {
        auto g = csr<edge>(_n, edges);
        int now_ord = 0, group_num = 0;
        std::vector<int> visited, low(_n), ord(_n, -1), ids(_n);
        visited.reserve(_n);
        auto dfs = [&](auto self, int v) -> void {
            low[v] = ord[v] = now_ord++;
            visited.push_back(v);
            for (int i = g.start[v]; i < g.start[v + 1]; i++) {
                auto to = g.elist[i].to;
                if (ord[to] == -1) {
                    self(self, to);
                    low[v] = std::min(low[v], low[to]);
                } else {
                    low[v] = std::min(low[v], ord[to]);
                }
            }
            if (low[v] == ord[v]) {
                while (true) {
                    int u = visited.back();
                    visited.pop_back();
                    ord[u] = _n;
                    ids[u] = group_num;
                    if (u == v) break;
                }
                group_num++;
            }
        };
        for (int i = 0; i < _n; i++) {
            if (ord[i] == -1) dfs(dfs, i);
        }
        for (auto& x : ids) {
            x = group_num - 1 - x;
        }
        return {group_num, ids};
    }

    std::vector<std::vector<int>> scc() {
        auto ids = scc_ids();
        int group_num = ids.first;
        std::vector<int> counts(group_num);
        for (auto x : ids.second) counts[x]++;
        std::vector<std::vector<int>> groups(ids.first);
        for (int i = 0; i < group_num; i++) {
            groups[i].reserve(counts[i]);
        }
        for (int i = 0; i < _n; i++) {
            groups[ids.second[i]].push_back(i);
        }
        return groups;
    }

  private:
    int _n;
    struct edge {
        int to;
    };
    std::vector<std::pair<int, edge>> edges;
};

}  // namespace internal

}  // namespace atcoder

#include <cassert>
#include <vector>

namespace atcoder {

struct scc_graph {
  public:
    scc_graph() : internal(0) {}
    scc_graph(int n) : internal(n) {}

    void add_edge(int from, int to) {
        int n = internal.num_vertices();
        assert(0 <= from && from < n);
        assert(0 <= to && to < n);
        internal.add_edge(from, to);
    }

    std::vector<std::vector<int>> scc() { return internal.scc(); }

  private:
    internal::scc_graph internal;
};

}  // namespace atcoder

#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;
    }
}


#define ss second.second
#define sf second.first
using paii = pair<int, int>;
//chmin必要
/*
有向木の最小全域木を求める.
O(|V|*|E|)らしい.知らんけど
*/
template<class T>
T Chu_Liu_Edmonds_algorithm(const vector<pair<T, paii>>& E, int v, int root = 0) {//E:{重み,{start,end}} //v:|V| //root:根

    vector<pair<T, int>> Vm(v, pair<T, int>(1e9, -1));
    vector<int> gr(v, 0);
    vector<bool> P(v, false), f(v, false);
    int cnt = 0;
    T res = 0;
    vector<pair<T, paii>> nE;

    for (auto e : E) {
        chmin(Vm[e.ss], { e.first, e.sf });
    }
    Vm[root] = { -1, -1 };

    rep(i, v) {
        if (f[i]) continue;
        vector<int> ch;
        int x = i;
        for (; x != -1 && !f[x];) {
            f[x] = 1;
            ch.push_back(x);
            x = Vm[x].second;
        }
        if (x == -1) {
            rep(j, ch.size()) {
                gr[ch[j]] = cnt;
                cnt++;
            }
        }
        else {
            bool Q = 0;
            for (long long j : ch) {
                gr[j] = cnt;
                if (j == x) {
                    P[cnt] = 1;
                    Q = 1;
                }
                if (!Q) cnt++;
            }
            if (Q) cnt++;
        }
    }
    if (cnt == v) {
        T ans = 1;
        rep(i, v)ans += Vm[i].first;
        //cout<<ans<<endl;
        return ans;
    }

    rep(i, v) {
        if (i != root && P[gr[i]]) res += Vm[i].first;
    }

    for (auto e : E) {
        int p = e.ss;
        int s = gr[e.sf];
        int t = gr[e.ss];
        if (s == t) continue;
        else if (P[t]) {
            nE.push_back({e.first - Vm[p].first, { s, t }});
        }
        else {
            nE.push_back({e.first, { s, t }});
        }
    }
    //cout<<res<<endl;
    return res + Chu_Liu_Edmonds_algorithm(nE, cnt, gr[root]);
}



void solve() {
    ll N,M;
    cin>>N>>M;
    vector<pair<ll,paii>> G(M);
    rep(i,M){
        ll U,V,W;
        cin>>U>>V>>W;
        U--;V--;
        G[i]={W,{U,V}};
    }
    cout<<Chu_Liu_Edmonds_algorithm<ll>(G,N,0)<<endl;

}


int main() {

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

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


}