#include<bits/stdc++.h>
using namespace std;
const long long mod=1e9+7;
long long T,a,b,c,d[1000001],v[1000001],o,h[1000001],fa[1000001],q,w,e,an,cn,fac[1000001],inv[1000001],u[1000001],de[1000001];
char s[1000001];
struct p{long long q,w,e;}l[1000001],st[1000001];
long long pow_(long long qq,long long ww){long long ee=1;while(ww){if(ww&1) ee*=qq,ee%=mod;qq*=qq,qq%=mod,ww>>=1;}return ee%mod;}
inline int read(){int x=0,f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}return x*f;}
void add(long long qq,long long ww){l[++o].q=ww,l[o].w=h[qq],h[qq]=o;}
long long gcd(long long qq,long long ww){return !ww?qq:gcd(ww,qq%ww);}
long long find(long long qq){return qq==fa[qq]?qq:fa[qq]=find(fa[qq]);}
void merge(long long qq,long long ww){long long f1=find(qq),f2=find(ww);if(f1==f2) return;fa[f1]=f2;}
long long C(long long qq,long long ww){return fac[qq]*inv[ww]%mod*inv[qq-ww]%mod;}
bool cmp(p qq,p ww){return qq.e<ww.e;}
vector<p> qu[1000001];
void dfs(long long qq)
{
	if(u[qq])
	{
		if(v[qq])
		{
			long long mn=0;
			for(int i=cn;i>=1;i--)
			{
				mn=max(mn,st[i].w);
				if(st[i].q==qq) break;
			}
			an-=mn;
		}
		return;
	}
	v[qq]=1;
	u[qq]=1;
	for(int i=0;i<qu[qq].size();i++)
	{
		st[++cn]=p{qq,qu[qq][i].w,0};
		dfs(qu[qq][i].q);
		--cn;
	}
	v[qq]=0;
}
int main()
{
//	freopen("1.in","r",stdin);
	srand((unsigned)(time(0)^(*new int)));
	fac[0]=1;for(int i=1;i<=1000000;i++) fac[i]=fac[i-1]*i%mod;
	inv[1000000]=pow_(fac[1000000],mod-2);for(int i=999999;i>=0;i--) inv[i]=inv[i+1]*(i+1)%mod;
	T=1;
	scanf("%lld",&T);
	for(int ii=1;ii<=T;ii++)
	{
		scanf("%lld%lld",&a,&b);
		o=0;
		for(int i=1;i<=a;i++) h[i]=de[i]=0,qu[i].clear(),u[i]=0;
		for(int i=1;i<=b;i++)
		{
			scanf("%lld%lld%lld",&q,&w,&e);
			l[i]=p{q,w,e};
			qu[q].push_back(p{w,e,0});
		}
		sort(l+1,l+b+1,cmp);
		an=0;
		long long gg=0,t1=0,t2=0,t3=0;
		for(int i=1;i<=b;i++)
		{
			if(l[i].q>l[i].w)
			{
				t1=l[i].q,t2=l[i].w,t3=l[i].e;
				continue;
			}
			if(de[l[i].w]==0)
			{
				de[l[i].w]++;
				fa[l[i].w]=l[i].q;
				u[l[i].w]=l[i].e;
				an+=l[i].e;
				++gg;
//				cout<<l[i].q<<" "<<l[i].w<<"\n";
			}
		}
		long long mx=0,ggg=t1;
		while(t1!=t2&&t1!=0) mx=max(mx,u[t1]),t1=fa[t1];
		if(t1==0)
		{
			if(u[t2]>t3) an-=u[t2],an+=t3;
		}
		else
		{
			long long an1=an+t3;
			an1-=u[t2];u[t2]=t3;
			for(int i=1;i<t2;i++)
			{
				for(int j=0;j<qu[i].size();j++)
				{
					if(qu[i][j].q>=t2&&qu[i][j].q<=ggg)
					{
						an=min(an,an1-u[qu[i][j].q]+qu[i][j].w);
					}
				}
			}
		}
		printf("%lld\n",an);
	}
	return 0;
}