#include <bits/stdc++.h>
#define Nmax 200005

using namespace std;

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

int n, m, sol;
int t[Nmax], cnt[Nmax];
int a[Nmax], b[Nmax], len;
struct el
{
    int x, y, c;
    bool operator <(const el & A) const
    {
        return c < A.c;
    }
};

el V[2 * Nmax];

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

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

void Read()
{
    int i;
    fin >> n >> m;
    for(i = 1; i <= m; i++)
        fin >> V[i].x >> V[i].y >> V[i].c;
    sort(V + 1, V + 1 + m);
    fin.close();
}

void Solve()
{
    int i, x, y;
    Read();
    for(i = 1; i <= n; i++)
    {
        t[i] = -1;
        cnt[i] = -1;
    }
    for(i = 1; i <= m; i++)
    {
        x = Find(V[i].x);
        y = Find(V[i].y);
        if(x != y)
        {
            Union(x,y);
            sol += V[i].c;
            a[++len] = V[i].x;
            b[len] = V[i].y;
        }
    }
    fout << sol << "\n" << n - 1 << "\n";
    for(i = 1; i <= n - 1; i++)
        fout << a[i] << " " << b[i] << "\n";
    fout.close();
}

int main()
{
    Solve();
    return 0;
}