#include <bits/stdc++.h>
using namespace std;

ifstream fin("apm.in");
ofstream fout("apm.out");

struct Kruskal
{
    int x, y, c, v;
    bool operator <(const Kruskal e ) const
    {
        return c < e.c;
    }
} a[200005];
int n, m, t[200005];

void Citire()
{
    int i;
    fin >> n >> m;
    for(i=1;i<=m;i++)
    {
        fin >> a[i].x >> a[i].y >> a[i].c;
        a[i].v = 0;
    }
}

int FindRoot(int x)
{
    int rad, y;
    rad = x;
    while(t[rad] != 0)
        rad = t[rad];
    while(x != rad)
    {
        y = t[x];
        t[x] = rad;
        x = y;
    }
    return rad;
}

void Union(int x, int y)
{
    t[y] = x;
}

void Kruskal()
{
    sort(a + 1, a + m + 1);
    int x, y, cost, nrc, i, nr;
    nrc = n;
    cost = nr = 0;
    for(i=1;nrc > 1;i++)
    {
        x = FindRoot(a[i].x);
        y = FindRoot(a[i].y);
        if(x != y)
        {
            cost += a[i].c;
            a[i].v = 1;
            nr++;
            Union(x, y);
            nrc--;
        }
    }
    fout << cost << "\n" << nr << "\n";
    for(i=1;i<=m;i++)
        if(a[i].v == 1)
            fout << a[i].x << " " << a[i].y << "\n";
}

int main()
{
    Citire();
    Kruskal();
    fin.close();
    fout.close();
    return 0;
}