#include <fstream>
#include <algorithm>
#define nmax 200002
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
int n,m;
pair <int, pair<int,int> > v[nmax*2];
pair <int,int> arbore[nmax];
int t[nmax];
int rg[nmax];

int cauta(int x)
{
    int r,y;
    r=x;
    while(t[r]!=r)
    {
        r=t[r];
    }
    while(t[x]!=x)
    {
        y=t[x];
        t[x]=r;
        x=y;
    }
    return r;
}

void unire(int x,int y)
{
    if(rg[x]>rg[y])
        t[x]=t[y];
    else
        t[y]=t[x];
    if(rg[x]==rg[y])rg[y]++;
}


int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        t[i]=i;
        rg[i]=1;
    }
    for(int i=1;i<=m;i++)
    {
        fin>>v[i].second.first>>v[i].second.second>>v[i].first;
    }
    sort(v+1,v+m+1);
    int sum=0;
    int nr_muchii=0;
    for(int i=1;i<=m;i++)
    {
        int x=v[i].second.first;
        int y=v[i].second.second;
        int radx=cauta(x);
        int rady=cauta(y);
        if(rady!=radx)
        {
            sum+=v[i].first;
            nr_muchii++;
            pair <int,int> muchie;
            muchie.first=x;
            muchie.second=y;
            arbore[nr_muchii]=muchie;
            unire(radx,rady);
        }
    }
    fout<<sum<<"\n"<<nr_muchii<<"\n";
    for(int i=1;i<=nr_muchii;i++)
    {
        fout<<arbore[i].first<<" "<<arbore[i].second<<"\n";
    }
    return 0;
}