#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
FILE *f,*g;
struct edge
{
    int x,y,c;
}muchie[400002],v[200002];
int t[200002],rang[200002];
int n,m,sol,cost;
bool how(edge p, edge q)
{
    return p.c<q.c;
}
void read()
{
    fscanf(f,"%d %d",&n,&m);
    for(int i=1; i<=m; i++)
        fscanf(f,"%d %d %d",&muchie[i].x, &muchie[i].y, &muchie[i].c);
}
int root(int node)
{
    if(t[node]!=node)
        t[node]=root(t[node]);
    return t[node];
}
void unite(int x, int y)
{
    if(rang[x]>rang[y])
        t[y]=x;
    else
        t[x]=y;
    if(rang[x]==rang[y])
        rang[x]++;
}
void apm()
{   int a,b;
    sort(muchie+1,muchie+m+1,how);
    for(int i=1; i<=n; i++)
        t[i]=i;
    for(int i=1; i<=m || sol>=n; i++)
    {
        a=root(muchie[i].x);
        b=root(muchie[i].y);
        if(a!=b)
        {
            unite(a,b);
            cost+=muchie[i].c;
            v[++sol]=muchie[i];
        }
    }
}
void write()
{
    fprintf(g,"%d\n%d\n",cost,sol);
    for(int i=1; i<=sol; i++)
        fprintf(g,"%d %d\n",v[i].x,v[i].y);
}
int main()
{
    f=fopen("apm.in","r");
    g=fopen("apm.out","w");
    read();
    apm();
    write();
    fclose(f);
    fclose(g);
    return 0;
}