#include <fstream>
#include <vector>
#include <algorithm>
#define NMAX 200002
using namespace std;
ifstream  fin("apm.in");
ofstream fout("apm.out");
int N,M,cmin,rad[NMAX],nr[NMAX];
vector<pair<int,int>>sol;

struct muchie
{
    int x,y,c;
}v[2*NMAX];

bool cmp(muchie a, muchie b)
{
    return a.c<b.c;
}

void citire()
{
    fin>>N>>M;

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

int FIND(int x)
{
    if(x==rad[x])
    {
        return x;
    }
    rad[x]=FIND(rad[x]);
    return rad[x];
}

void UNION(int a, int b)
{
    if(nr[a]>nr[b])
    {
        rad[b]=rad[a];
        nr[a]+=nr[b];
    }
    else
    {
        rad[a]=rad[b];
        nr[b]+=nr[a];
    }
}

int main()
{
    citire();

    for(int i=1; i<=N; i++)
    {
        rad[i]=i;
        nr[i]=1;
    }

    cmin=0;
    sort(v+1,v+1+M,cmp);
    for(int i=1; i<=M; i++)
    {
        int a,b;
        a=FIND(v[i].x);
        b=FIND(v[i].y);

        if(a!=b)
        {
            cmin+=v[i].c;
            sol.push_back({v[i].x,v[i].y});
            UNION(a,b);
        }
    }

    fout<< cmin << "\n";

    fout<< sol.size() << "\n";

    for(int i=0; i<sol.size(); i++)
    {
        fout<< sol[i].first << " " << sol[i].second << "\n";
    }

    return 0;
}