#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using pii = pair<int, int>;

const int N = 5e5 + 10;

struct Node {
    int u, v, w;
} e[N];

struct Edge {
    int id, v, w;
};

int T, n, m, to[N];
vector<Edge> g[N];
vector<pii> G;

void Solve() {
    cin >> n >> m;
    int p;
    for (int i = 1, u, v, w; i <= m; i++) {
        cin >> u >> v >> w;
        if (u < v) {
            g[v].push_back({i, u, w});
        } else p = i;
        e[i] = {u, v, w};
        if (u == 1) G.push_back({v, w});
    }
    ll ans = 0;
    for (int i = 2; i <= n; i++) {
        int mmin = 1e9;
        for (Edge j : g[i]) mmin = min(mmin, j.w);
        ans += mmin;
    }
    if (e[p].v != 1) {
        ll sum = e[p].w;
        int c = 0;
        for (int i = 2; i <= n; i++) {
            if (i == e[p].v) continue;
            int mmin = 1e9, id;
            for (Edge j : g[i]) {
                if (j.v != e[p].v && (mmin > j.w || (mmin == j.w && j.v == 1))) mmin = j.w, id = j.id;
            }
            if (e[id].u == 1) c++;
            sum += mmin, to[i] = id;
        }
        if (!c) {
            for (pii i : G) {
                if (e[p].v == i.first) continue;
                ans = min(ans, sum - e[to[i.first]].w + i.second);
            }
        } else ans = min(ans, sum);
    }
    cout << ans << '\n';
    for (int i = 1; i <= n; i++) g[i].clear();
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    cin >> T;
    while (T--) Solve();
    return 0;
}