#include <iostream>
#include <fstream>
#include <algorithm>
#define M 400005
#define N 200002
using namespace std;

ifstream x("apm.in");
ofstream y("apm.out");

pair <int,int>p[M];
int k,n,m,tot,t[N],r[N];

struct muchie
{
    int st,dr,cost;
}v[M];

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

void citire()
{
    x>>n>>m;
    for(int i=1;i<=m;i++)
        x>>v[i].st>>v[i].dr>>v[i].cost;
    sort(v+1,v+m+1,cmp);
    for(int i=1;i<=n;i++)
        t[i]=i,r[i]=1;
}

int  tata(int nod)
{
    while(t[nod]!=nod)
        nod=t[nod];
    return nod;
}

void uni(int noda,int nodb)
{
    if(r[noda]<r[nodb])
        t[noda]=nodb;
    if(r[noda]>r[nodb])
        t[nodb]=noda;

    if(r[noda]==r[nodb])
        t[noda]=nodb,r[nodb]++;
}

void solve()
{
    for(int i=1;i<=m;i++)
    {
        if(tata(v[i].st)!=tata(v[i].dr))
        {
            uni(tata(v[i].st),tata(v[i].dr));
            p[++k].first=v[i].st;
            p[k].second=v[i].dr;
            tot+=v[i].cost;
        }
    }
}

void afis()
{
    y<<tot<<'\n';
    y<<n-1<<'\n';
    for(int i=1;i<n;i++)
        y<<p[i].first<<" "<<p[i].second<<'\n';
}

int main()
{
    citire();
    solve();
    afis();
    x.close();
    y.close();
    return 0;
}