#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<vector>

#include<map>

#include<set>

#include<queue>

#include<stack>

#include<iostream>

using namespace std;

typedef long long LL;

const int maxn =  + ;

int T, n, m, f[maxn], c[maxn];

bool flag[maxn];

struct Edge { int u, v; LL cost; }e[ * maxn], ee[maxn];

vector<int>g[maxn];

double fz, fm;

int Find(int x) { if (x != f[x]) f[x] = Find(f[x]); return f[x]; }

bool cmp(const Edge&a, const Edge&b) { return a.cost < b.cost; }

void dfs(int x,int f)

{

    flag[x] = ; c[x] = ;

    for (int i = ; i < g[x].size(); i++)

    {

        int id = g[x][i]; if (flag[ee[id].v]) continue;

        dfs(ee[id].v,id); c[x] = c[x] + c[ee[id].v];

    }

    if (f != -)

        fz = fz + 1.0*ee[f].cost*1.0*c[x] * 1.0* (n - c[x]);

}

int main()

{

    scanf("%d", &T);

    while (T--)

    {

        scanf("%d%d", &n, &m);

        for (int i = ; i <= m; i++)

            scanf("%d%d%lld", &e[i].u, &e[i].v, &e[i].cost);

        sort(e + , e +  + m, cmp);

        LL ans = ;

        for (int i = ; i <= n; i++) f[i] = i, g[i].clear();

        int sz = ;

        for (int i = ; i <= m; i++)

        {

            int fx = Find(e[i].u), fy = Find(e[i].v);

            if (fx != fy)

            {

                f[fx] = fy, ans = ans + e[i].cost;

                ee[sz].u = e[i].u, ee[sz].v = e[i].v, ee[sz].cost = e[i].cost;

                g[e[i].u].push_back(sz++);

                ee[sz].u = e[i].v, ee[sz].v = e[i].u, ee[sz].cost = e[i].cost;

                g[e[i].v].push_back(sz++);

            }

        }

        memset(c, fz=, sizeof c);

        memset(flag, fm=, sizeof flag);

        dfs(, -);

        fm = 1.0*n*1.0*(n - ) / 2.0;

        printf("%lld %.2lf\n", ans, fz / fm);

    }

    return ;

}