// File Name: 3488.cpp
// Author: Zlbing
// Created Time: 2013/4/21 20:14:19

#include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<cstdio>
#include<set>
#include<map>
#include<vector>
#include<cstring>
#include<stack>
#include<cmath>
#include<queue>
using namespace std;
#define CL(x,v); memset(x,v,sizeof(x));
#define INF 0x3f3f3f3f
#define LL long long
#define REP(i,r,n) for(int i=r;i<=n;i++)
#define RREP(i,n,r) for(int i=n;i>=r;i--)const int MAXN=205;
int N,M;
int Left[MAXN];
int w[MAXN][MAXN];
int Lx[MAXN],Ly[MAXN];
bool S[MAXN],T[MAXN];
bool match(int i)
{S[i]=true;for(int j=1;j<=N;j++)if(Lx[i]+Ly[j]==w[i][j]&&!T[j]){T[j]=true;if(Left[j]==0||match(Left[j])){Left[j]=i;return true;}}return false;
}
void update(){int a=INF;for(int i=1;i<=N;i++)if(S[i])for(int j=1;j<=N;j++)if(!T[j])a=min(a,Lx[i]+Ly[j]-w[i][j]);for(int i=1;i<=N;i++){if(S[i])Lx[i]-=a;if(T[i])Ly[i]+=a;}
}
void KM()
{for(int i=1;i<=N;i++){Left[i]=Lx[i]=Ly[i]=0;for(int j=1;j<=N;j++){Lx[i]=max(Lx[i],w[i][j]);}}for(int i=1;i<=N;i++){for(;;){CL(S,0);CL(T,0);if(match(i))break;else update();}}
}int main()
{int cas;scanf("%d",&cas);while(cas--){scanf("%d%d",&N,&M);REP(i,1,N)REP(j,1,N)w[i][j]=-INF;REP(i,1,M){int a,b,c;scanf("%d%d%d",&a,&b,&c);w[a][b]=max(w[a][b],-c);}KM();int ans=0;
//        REP(i,1,N){
//            REP(j,1,N)
//            printf("w[%d][%d]=%d ",i,j,w[i][j]);
//            printf("\n");
//            printf("Left[i]=%d\n",i,Left[i]);
//        }
REP(i,1,N){ans+=-w[Left[i]][i];}printf("%d\n",ans);}return 0;
}