#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

struct muke {int x,y,c;} a[400001],b[200001];
int n,m,viz[200001];

bool comparare(muke a,muke b){return a.c<b.c;}

int main()
{
    ifstream fin("apm.in");
    fin>>n>>m;
    int i,j;
    for(i=1;i<=m;i++)
        fin>>a[i].x>>a[i].y>>a[i].c;
    //sortam muchiile dupa cost:
    sort(a+1,a+m+1,comparare);
    for(i=1;i<=n;i++)viz[i]=i;
    //alegem n-1 muchii in ordinea costurilor
    int k=0,cost=0;
    i=1;
    while(k<n-1)
    {
        if(viz[a[i].x]!=viz[a[i].y])
        {
            b[++k]=a[i];
            cost+=a[i].c;
            //toate alea marcate cu marca lui y
            //le marcam cu marca lui x:
            int marca1=viz[a[i].y],marca2=viz[a[i].x];
            for(j=1;j<=n;j++)
                if(viz[j]==marca1)viz[j]=marca2;
        }
        i++;
    }
    ofstream fout("apm.out");
    fout<<cost<<"\n"<<k<<"\n";
    for(i=1;i<=k;i++)fout<<b[i].x<<" "<<b[i].y<<"\n";
    return 0;
}