#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
int n,m,aux[100005],costmin,k;
struct muchie
{
    int x,y,cost;
    bool operator <(const muchie& M) const{
        return cost < M.cost;
    }

}v[100005];

void read()
{
    fin>>n>>m;
    int i;
    for(i=1;i<=m;i++)
    {
        fin>>v[i].x>>v[i].y>>v[i].cost; //citire muchie si costul sau
    }
}

int FindRoot(int a)
{
    int root,b;
    root = a;
    while(aux[root] != 0)
    {
        root = aux[root];
    }
    while(a != root)
    {
        b = aux[a];
        aux[a] = root;
        a = b;
    }
    return root;
}

void Union(int a,int b)
{
    aux[b] = a;
}

void Solve()
{
    int x,y,i,nrc=n;
    costmin = 0;
    sort(v+1,v+m+1);
    for(i=1;i<=m && nrc>1;i++)
    {
        x = v[i].x;
        y = v[i].y;
        x = FindRoot(x);
        y = FindRoot(y);
        if(x!=y)
        {
            Union(x,y);
            nrc--;
            costmin += v[i].cost;
        }
    }
}

void afis()
{
    int i,nr=0;
    fout<<costmin<<'\n'<<n-1<<endl;;
    for(i=1;i<m;i++)
    {
        fout<<v[i].x<<" "<<v[i].y<<endl;
    }
}
int main()
{
    read();
    Solve();
    afis();



    return 0;
}