#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
using namespace std;
const int maxn=1e6+10;
const int mod=1e9+7;
long long read(){
	long long ans=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9'){
		if(c=='-') f=-1;
	 	c=getchar();
	}
	while(c>='0'&&c<='9'){
	 	ans=ans*10+c-'0';
	 	c=getchar();
	}
	return ans*f;
}
int n,m,z,t,fa[maxn];
char s[maxn];
struct node{
	int x,y,z;
	int next,to;
}e[maxn*2],h[maxn];
bool cmp(node a,node b){
	return a.z<b.z;
}
int find(int x){
	if(x==fa[x]) return x;
	return fa[x]=find(fa[x]);
}
int f[maxn][21],head[maxn],k=0;
void add(int x,int y,int z){
	e[++k].next=head[x];
	e[k].to=y;
	e[k].z=z;
	head[x]=k;
}
int deep[maxn],bk[maxn],fz[maxn][21][2];
void dfs(int id,int ff){
	deep[id]=deep[ff]+1;
	f[id][0]=ff;
	for(int i=1;i<20;i++){
		if(f[id][i-1]==0) break;
		f[id][i]=f[f[id][i-1]][i-1];
		fz[id][i][1]=max(fz[f[id][i-1]][i-1][1],fz[id][i-1][1]);
		fz[id][i][0]=max(fz[f[id][i-1]][i-1][0],fz[id][i-1][0]);
	}
	for(int i=head[id];i;i=e[i].next){
		int tp=e[i].to;
		if(tp==ff) continue;
		if(e[i].z%2){
			fz[tp][0][1]=e[i].z;
			fz[tp][0][0]=0;
		}
		else{
			fz[tp][0][0]=e[i].z;
			fz[tp][0][1]=0;
		}
		dfs(tp,id);
	}
}
int lca(int a,int b,int op){
	if(deep[a]>deep[b]) return lca(b,a,op);
	int tmp=0;
	for(int i=19;i>=0;i--){
		if(deep[f[b][i]]<deep[a]) continue;
		tmp=max(tmp,fz[b][i][op]);
		b=f[b][i];
	}
	if(b==a) return tmp;
	for(int i=19;i>=0;i--){
		if(f[b][i]==f[a][i]) continue;
		tmp=max(tmp,fz[b][i][op]);
		tmp=max(tmp,fz[a][i][op]);
		b=f[b][i];
		a=f[a][i];
	}
	tmp=max(tmp,fz[a][0][op]);
	tmp=max(tmp,fz[b][0][op]);
	return tmp;
}
int main(){
	t=read();
	while(t--){
		n=read();m=read();
		for(int i=1;i<=m;i++){
			h[i].x=read();
			h[i].y=read();
			h[i].z=read();
			bk[i]=0;
		}
		sort(h+1,h+m+1,cmp);
		for(int i=1;i<=n;i++){
			fa[i]=i;
			head[i]=0;
		}
		k=0;
		long long sm=0,ans=-1;
		int cnt=n-1,c;
		for(int i=1;i<=m;i++){
			int a=find(h[i].x);
			int b=find(h[i].y);
			if(a==b) continue;
			bk[i]=1;
			fa[a]=b;
			sm+=h[i].z;
			add(h[i].x,h[i].y,h[i].z);
			add(h[i].y,h[i].x,h[i].z);
			cnt--;
			if(!cnt) break;
		}
		if(cnt>0){
			printf("-1 -1\n");
			continue;
		}
		dfs(1,0);
		for(int i=1;i<=m;i++){
			if(bk[i]) continue;
			if(h[i].z%2) c=lca(h[i].x,h[i].y,0);
			else c=lca(h[i].x,h[i].y,1);
			//printf("%d %d\n",lca(h[i].x,h[i].y,0),lca(h[i].x,h[i].y,1));
			if(c==0) continue;
			
			long long tmp=sm+h[i].z-c;
			if(ans>0) ans=min(ans,tmp);
			else ans=tmp;
		}
		if(sm%2) printf("%lld %lld\n",ans,sm);
		else printf("%lld %lld\n",sm,ans);
	}
	return 0;
}