#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5, M = 5e5 + 5;
const ll inf = 0x3f3f3f3f3f3f3f3f;
int head[N], nxt[M << 1], e[M << 1], to[M << 1], from[M << 1], cnt = 1;
void add(int u, int v, int w)
{
    nxt[++cnt] = head[u], head[u] = cnt, to[cnt] = v, e[cnt] = w, from[cnt] = u;
    // nxt[++cnt] = head[v], head[v] = cnt, to[cnt] = u, e[cnt] = w, from[cnt] = v;
}

int n, m;
int vis[N];

void solve() {
    cin >> n >> m;
    cnt = 1;
    for (int i = 0; i <= m * 2 + 2; i++) head[i] = 0;
    for (int i = 1; i <= n; i++) vis[i] = 0;
    for (int i = 1; i <= m; i++) {
        int x, y, z;
        cin >> x >> y >> z;
        // add(y, x, z);
        add(x, y, z);
    }

    set<pair<int, int>> st;    
    vis[1] = 1;
    for (int i = head[1]; i; i = nxt[i]) {
        st.insert(make_pair(e[i], i));
    }

    ll ans = 0;

    while(!st.empty()) {
        int w = st.begin()->first;
        int edge = st.begin()->second;
        st.erase(st.begin());
        int v = to[edge];
        if (vis[v]) continue;
        ans += w;
        vis[v] = 1;
        for (int i = head[v]; i; i = nxt[i]) {
            st.insert(make_pair(e[i], i));
        }
    }

    cout << ans << endl;
}


int main()
{
    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
    #endif

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

    int T = 1;
    cin >> T;
    while(T--) solve();
    return 0;
}