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

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

struct muchie
{
    int x , y , c , ales;
    bool operator < (muchie m) const
    {
        return c < m.c;
    }
};
muchie a[400005];
int n , m , t[200005] , cost;

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

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

int Find(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 Kruskal()
{
    int i , x , y;
    sort(a + 1 , a + m + 1);
    for(i = 1;i <= m;i++)
    {
        x = Find(a[i].x);
        y = Find(a[i].y);
        if(x != y)
        {
            Union(x , y);
            cost += a[i].c;
            a[i].ales = 1;
        }
    }
}

void Afis()
{
    fout << cost << "\n" << n - 1 << "\n";
    for(int i = 1;i <= m;i++)
        if(a[i].ales == 1)
            fout << a[i].x << " " << a[i].y << "\n";
}

int main()
{
    Citire();
    Kruskal();
    Afis();
    return 0;
}