#include <bits/stdc++.h>
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> void chkmax(T &x, T y) { x = max(x, y); }
template <typename T> void chkmin(T &x, T y) { x = min(x, y); }
template <typename T> void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
	x *= f;
}
const int N = 2e5 + 10;
namespace priorityqueue {
	int tot, ls[N], rs[N], dist[N], sz[N], tag[N];
	pair <int, int> val[N];
	void down(int num, int x) {
		val[num].first += x;
		tag[num] += x;
	}
	void pushdown(int x) {
		if (tag[x]) {
			down(ls[x], tag[x]); down(rs[x], tag[x]);
			tag[x] = 0;
		}
	}
	int merge(int x, int y) {
		if (!x || !y) return x | y;
		assert(x != y);
		pushdown(x); pushdown(y);
		if (val[x] > val[y]) swap(x, y);
		rs[x] = merge(rs[x], y);
		if (dist[rs[x]] > dist[ls[x]]) swap(ls[x], rs[x]);
		return sz[x] = sz[ls[x]] + sz[rs[x]] + 1, dist[x] = dist[rs[x]] + 1, x;
	}
	struct priorityqueue {
		int rt;
		priorityqueue() { rt = 0; }
		void join(priorityqueue &x) { rt = merge(rt, x.rt); x.rt = 0; }
		void push(pair <int, int> x) { val[++tot] = x, sz[tot] = 1; rt = merge(rt, tot); }
		void pop() { assert(sz[rt]); pushdown(rt); rt = merge(ls[rt], rs[rt]); }
		pair <int, int> top() { assert(sz[rt]); return val[rt]; }
		int size() { return sz[rt]; }
		bool empty() { return !size(); }
		void clear() { rt = 0; }
		void add(int x) { down(rt, x); }
	};
}
priorityqueue::priorityqueue q[N];
int sz, n, m, r, s[N], fa[N];
bool vis[N], out[N];
ll ans;
int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); }
bool solve(int x) {
	s[++sz] = x;
	while (!vis[s[sz]] || out[s[sz]]) {
		int x = s[sz];
		if (out[x]) {
			do {
				int y = s[sz--];
				q[y].add(-q[y].top().first);
				if (y != x) fa[y] = x, q[x].join(q[y]), out[y] = false;
			} while (s[sz] != x);
		}
		vis[x] = out[x] = true;
		while (q[x].size() && find(q[x].top().second) == x) q[x].pop();
		if (q[x].empty()) return false;
		ans += q[x].top().first;
		s[++sz] = find(q[x].top().second);
	}
	while (sz) out[s[sz--]] = false;
	return true;
}
void zhk() {
	read(n); read(m); r = 1;
	ans = sz = 0;
	F(i, 1, n) fa[i] = i, q[i].clear(), vis[i] = out[i] = false;
	vis[r] = true;
	F(i, 1, m) {
		int x, y, z; read(x); read(y); read(z);
		q[y].push(make_pair(z, x));
	}
	F(i, 1, n)
		if (!solve(i)) assert(false);
	cout << ans << '\n';
}
signed main() {
	int _; read(_);
	while (_--) zhk();
	return 0;
}