#include    <fstream>
#include    <algorithm>
using namespace std;
ifstream    fin("apm.in");
ofstream    fout("apm.out");
const int NMax = 400005;
pair <int,int> P[NMax];
int N, M, Total, TT[NMax], k, RG[NMax];
struct Edge{int x,y,c;}V[NMax];
bool Compare(Edge a, Edge b)
{
    return a.c < b.c;
}
int Find(int nod)
{
    while(TT[nod] != nod)
        nod = TT[nod];
    return nod;
}

int main()
{
    fin >> N >> M;
    for(int i = 1; i <= M; i++)
        fin >> V[i].x >> V[i].y >> V[i].c;

    sort(V+1, V+M+1, Compare);
    for(int i = 1; i <= N; i++)
    {
        TT[i]=i;
        RG[i]=1;
    }
    for(int i=1;i<=M;i++)
    {
        int x=Find(V[i].x);
        int y=Find(V[i].y);
        if(x != y)
        {
            Total           +=  V[i].c;
            if(RG[x] < RG[y])
                TT[x] = y;
            if(RG[y] < RG[x])
                TT[y] = x;
            if(RG[x] == RG[y])
            {
                TT[x]=y;
                RG[y]++;
            }
            P[++k].first    =   V[i].x;
            P[k].second     =   V[i].y;
        }
    }

    fout << Total << "\n";
    fout << N-1 <<"\n";

    for(int i = 1; i <= k; i++)
        fout << P[i].first << " " << P[i].second << "\n";

    return 0;
}