#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <stack>
#include <bits/stdc++.h>
using namespace std;#define For(i,j,n) for(int i=j;i<=n;i++)
#define mst(ss,b) memset(ss,b,sizeof(ss));typedef  long long LL;template<class T> void read(T&num) {char CH; bool F=false;for(CH=getchar();CH<'0'||CH>'9';F= CH=='-',CH=getchar());for(num=0;CH>='0'&&CH<='9';num=num*10+CH-'0',CH=getchar());F && (num=-num);
}
int stk[70], tp;
template<class T> inline void print(T p) {if(!p) { puts("0"); return; }while(p) stk[++ tp] = p%10, p/=10;while(tp) putchar(stk[tp--] + '0');putchar('\n');
}const LL mod=1e9+7;
const double PI=acos(-1.0);
const int inf=1e9;
const int N=1e6+10;
const int maxn=1e5+10;
const double eps=1e-5;int n,m,head[maxn],p[maxn],num[maxn],cnt;int findset(int x){if(x==p[x])return x;return p[x]=findset(p[x]);}
struct Edge
{int from,to,next,val;
}edge[N];int cmp(Edge a,Edge b)
{return a.val<b.val;
}
struct node
{int to,val;
};
vector<pair<int,int> >ve[maxn];
void add_edge(int s,int e,int va)
{edge[cnt].from=s;edge[cnt].to=e;edge[cnt].next=head[s];edge[cnt].val=va;head[s]=cnt++;
}LL dis=0;int dfs(int cur,int fa,int val){int len=ve[cur].size();num[cur]=1;For(i,0,len-1){int x=ve[cur][i].first,va=ve[cur][i].second;if(x==fa)continue;num[cur]+=dfs(x,cur,va);}dis=dis+(LL)num[cur]*(n-num[cur])*val;return num[cur];}
int main()
{int t;read(t);while(t--){cnt=0;dis=0;read(n);read(m);For(i,0,n){head[i]=-1;p[i]=i;ve[i].clear();}For(i,1,m){int u,v,w;read(u);read(v);read(w);add_edge(u,v,w);}sort(edge,edge+m,cmp);LL sum=0;For(i,0,m-1){int fa=findset(edge[i].from),fb=findset(edge[i].to);if(fa!=fb){p[fa]=fb;sum=sum+edge[i].val;ve[edge[i].from].push_back({edge[i].to,edge[i].val});ve[edge[i].to].push_back({edge[i].from,edge[i].val});}}dfs(1,0,0);printf("%lld %.2lf\n",sum,dis*1.0/(0.5*(n-1)*n));}return 0;
}