#include <stdio.h>
#include <vector>
#include <utility>
#include <queue>
#include <bitset>
#include <algorithm>
#define NMax 200000
using namespace std;
typedef struct
{
    int x,y,cost;
}NOD;
struct CMP
{
    bool operator()(const NOD A,const NOD B)
    {
        return (A.cost<B.cost)?false:true;
    }
};
bool Compare(const NOD A,const NOD B)
{
    return A.cost<B.cost;
}
std::vector< std::pair<int,int> > SUB;
std::vector<NOD> coada;
std::vector<int> M[NMax];
int n,m,x,y,cost,viz[NMax];
void APM(int x0)
{
    int contor = 1;
    viz[x0] = contor;
    M[1].push_back(x0);
    while(!coada.empty())
    {
        NOD aux = coada[0];
        coada.erase(coada.begin());
        if(viz[aux.x]==0&&viz[aux.y]==0)
        {
            contor++;
            viz[aux.x]=contor;
            viz[aux.y]=contor;
            M[contor].push_back(aux.x);
            M[contor].push_back(aux.y);
            SUB.push_back( std::make_pair(aux.x,aux.y) );
            cost+=aux.cost;
        }
        else if((viz[aux.x]==0&&viz[aux.y]!=0)||(viz[aux.x]!=0&&viz[aux.y]==0))
        {
            if(viz[aux.x]!=0)
            {
                viz[aux.y] = viz[aux.x];
                M[aux.x].push_back(aux.y);
            }
            else if(viz[aux.y]!=0)
            {
                viz[aux.x] = viz[aux.y];
                M[aux.y].push_back(aux.x);
            }
            SUB.push_back( std::make_pair(aux.x,aux.y) );
            cost+=aux.cost;
        }
        else if(viz[aux.x]!=viz[aux.y])
        {
            int xyz = viz[aux.y];
            for(int i=M[viz[aux.y]].size()-1;i>=0;--i)
            {
                M[ viz[aux.x] ].push_back( M[ xyz ][ i ] );
                viz[ M[ xyz ][ i ] ] = viz[aux.x];
                M[ xyz ].erase(M[ xyz ].begin()+i);
            }
            SUB.push_back( std::make_pair(aux.x,aux.y) );
            cost+=aux.cost;
        }
        if(SUB.size()==n-1)break;
    }
}
int main()
{
    freopen("apm.in","r",stdin);
    freopen("apm.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(int i=1;i<=m;++i)
    {
        scanf("%d %d %d",&x,&y,&cost);
        NOD aux;
        aux.x = x;
        aux.y = y;
        aux.cost = cost;
        coada.push_back( aux );
    }
    sort(coada.begin(),coada.end(),Compare);
    cost = 0;
    APM(1);
    printf("%d\n%d\n",cost,SUB.size());
    for(int i=0;i<SUB.size();++i)
    {
        printf("%d %d\n",SUB[i].first,SUB[i].second);
    }
    return 0;
}