#include <bits/stdc++.h>

using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
const int nmax = 200005;
int N,M,ans,a[nmax],b[nmax],len;
int t[nmax],values[nmax];
struct Edge
{
    int x,y,c;
    bool operator < (const Edge &A)
    {
        return c < A.c;
    }
};
Edge E[2*nmax];

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

inline 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;
}


inline void Read()
{
    fin >> N >> M;
    for(int i = 1; i <= M; i++) fin >> E[i].x >> E[i].y >> E[i].c;
    sort(E+1,E+M+1);
}

inline void Solve()
{
    int i,j,r1,r2;
    for(i = 1; i <= N; i++) t[i] = -1, values[i] = 1;
    for(i = 1; i <= M; i++)
    {
        r1 = Find(E[i].x);
        r2 = Find(E[i].y);
        if(r1 != r2)
        {
            Union(r1,r2);
            ans += E[i].c;
            a[++len] = E[i].x;
            b[len] = E[i].y;
        }
    }
    fout << ans << "\n" << N-1 << "\n";
    for(i = 1; i <= N-1; i++)
        fout << a[i] << " " << b[i] << "\n";
}

int main()
{
    Read();
    Solve();
    fout.close();
    return 0;
}