#include <bits/stdc++.h>

using namespace std;

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

struct PR
{
    int x, y, cost, p;
};

PR a[40006];
int n, m, s, suma;
int t[20006];
int Find(int x)
{
    int rad, y;
    rad = x;
    while(t[rad])
        rad = t[rad];
    while(x != rad)
    {
        y = t[x];
        t[x] = rad;
        x = y;
    }
    return rad;
}

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

void Citire()
{
    int i;

    fin >> n >> m;

    for(i = 1; i <= m; i++)
        fin >> a[i].x >> a[i].y >> a[i].cost;
}


inline bool Compar(const PR A, const PR B)
{
    return A.cost < B.cost;
}
void Rezolva()
{
    int i;
    int x, y;
    sort(a + 1, a + m + 1, Compar);
    for(i = 1; i <= m; i++)
    {
        x = Find(a[i].x);
        y = Find(a[i].y);
        if(x != y)
        {
            a[i].p = 1;
            Union(x, y);
            suma += a[i].cost;
            s++;
        }
    }
    fout << suma << "\n" << s << "\n";
    for(i = 1; i <= m; i++)
        if(a[i].p == 1)
            fout << a[i].y << " " << a[i].x << "\n";

}
int main()
{
    Citire();
    Rezolva();
    return 0;
}