#include <bits/stdc++.h>

using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
const int nmax = 200005;
int n, m, t[nmax], ans;
bool viz[2*nmax];
struct Edge
{
    int x, y, cost;
    bool operator < (const Edge &A) const
    {
        return cost < A.cost;
    }
} E[2*nmax];
void Union(int x, int y)
{
    t[x] = y;
}
int Find(int x)
{
    int rad = x, aux;
    while(rad != t[rad])
        rad = t[rad];
    if(x != rad)
    {
       aux = t[x];
       t[x] = rad;
       x = aux;
    }
    return rad;
}
int main()
{
    fin >> n >> m;
    for(int i = 1; i <= m; ++i)
        fin >> E[i].x >> E[i].y >> E[i].cost;
    sort(E + 1, E + m  + 1);
    for(int i = 1; i <= n; ++i)
        t[i] = i;
    for(int i = 1; i <= m; ++ i)
    {
        int r1 = Find(E[i].x);
        int r2 = Find(E[i].y);
        if(r1 != r2)
        {
            ans += E[i].cost;
            Union(r1, r2);
            viz[i] = true;
        }
    }
    fout << ans  << "\n" << n - 1 << "\n";
    for(int i = 1; i <= m; ++i)
        if(viz[i])
            fout << E[i].x << " " << E[i].y << "\n";
    return 0;
}