#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int M=1e5+5,mod=1e9+7;
constexpr ll inf=0x3f3f3f3f3f3f3f3f;
struct info{ll val;int num;
	info(ll val_=0,int num_=0){val=val_;num=num_;}
};
struct node{
	info dp00,dp01,dp10,dp11;
	node(info dp00_=info(0,0),info dp01_=info(0,0),info dp10_=info(0,0),info dp11_=info(0,0))
		{dp00=dp00_;dp01=dp01_;dp10=dp10_;dp11=dp11_;}
	node rev(){return node(dp00,dp10,dp01,dp11);}
};
int rdc(int x){return x>=mod?x-mod:x;}
info operator +(info a,info b){return a.val==b.val?info(a.val,rdc(a.num+b.num)):a.val>b.val?a:b;}
info operator *(info a,info b){return info(a.val+b.val,1ll*a.num*b.num%mod);}
node operator +(node a,node b){return node(a.dp00+b.dp00,a.dp01+b.dp01,a.dp10+b.dp10,a.dp11+b.dp11);}
map<pair<int,int>,node>mp;
int n,m;set<int>adj[M];
int read(){
	int x=0;char ch=getchar();
	while (!isdigit(ch)) ch=getchar();
	while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
	return x;
}
void solve(){
	n=read();m=read();mp.clear();
	for (int i=1;i<=n;i++) adj[i].clear();
	for (int i=1;i<=m;i++){
		int x=read(),y=read(),z=read();
		adj[x].insert(y);adj[y].insert(x);
		if (!mp.count(minmax(x,y)))
			{mp[minmax(x,y)]=node(info(0,1),info(-inf,0),info(-inf,0),info(z,1));continue;}
		const info tmp=mp[minmax(x,y)].dp11;
		if (z>tmp.val) mp[minmax(x,y)]=node(info(0,1),info(-inf,0),info(-inf,0),info(z,1));
		else if (z==tmp.val) mp[minmax(x,y)]=node(info(0,1),info(-inf,0),info(-inf,0),info(z,tmp.num+1));
	} queue<int>q;
	for (int i=1;i<=n;i++)
		if (adj[i].size()==2)
			q.push(i);
	while (!q.empty()){
		int u=q.front();q.pop();
		if (adj[u].size()!=2) continue;
		int x=*adj[u].begin(),y=*adj[u].rbegin();
		adj[u].clear();
		adj[x].erase(u);adj[y].erase(u);
		adj[x].insert(y);adj[y].insert(x);
		if (adj[x].size()==2) q.push(x);
		if (adj[y].size()==2) q.push(y);
		node tmp1=mp[minmax(x,u)],tmp2=mp[minmax(u,y)];
		if (x>u) tmp1=tmp1.rev(); if (u>y) tmp2=tmp2.rev(); node tmp;
		tmp.dp00=tmp1.dp00*tmp2.dp00+tmp1.dp00*tmp2.dp10+tmp1.dp01*tmp2.dp00;
		tmp.dp01=tmp1.dp00*tmp2.dp01+tmp1.dp00*tmp2.dp11+tmp1.dp01*tmp2.dp01;
		tmp.dp10=tmp1.dp10*tmp2.dp00+tmp1.dp10*tmp2.dp10+tmp1.dp11*tmp2.dp00;
		tmp.dp11=tmp1.dp10*tmp2.dp01+tmp1.dp10*tmp2.dp11+tmp1.dp11*tmp2.dp01;
		if (mp.count(minmax(x,y))){
			node &res=mp[minmax(x,y)];
			res.dp11=res.dp11*tmp.dp00+res.dp10*tmp.dp01+res.dp01*tmp.dp10+res.dp00*tmp.dp11;
			res.dp10=res.dp10*tmp.dp00+res.dp00*tmp.dp10;
			res.dp01=res.dp01*tmp.dp00+res.dp00*tmp.dp01;
			res.dp00=res.dp00*tmp.dp00;
		}
		else mp[minmax(x,y)]=tmp;
	}
	for (int x=1;x<=n;x++)
		if (!adj[x].empty()){
			int y=*adj[x].begin();node tmp=mp[minmax(x,y)];
			info ans=tmp.dp00+tmp.dp01+tmp.dp10+tmp.dp11;
			return printf("%lld %d\n",ans.val,ans.num),void();
		}
}
int main(){int T=read();while (T--) solve();return 0;}