#include <fstream>
#include<vector>
#include<algorithm>
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
vector <int>p;
struct elem
{
    int x,y,c;
} v[400001];
int g[200001];
int compar(elem a,elem b)
{
    return (a.c<b.c);
}
int grupa(int i)
{
    if(g[i]==i)return i;
    g[i]=grupa(g[i]);
    return g[i];
}
void reun(int a,int b)
{
    g[grupa(a)]=grupa(b);
}

int main()
{
    int n,m,i,cost=0;
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>v[i].x>>v[i].y>>v[i].c;
    }

    for(i=1;i<=n;i++)
    {
        g[i]=i;
    }
    sort(v+1,v+m+1,compar);
    for(i=1; i<=m; i++)
    {
       if(grupa(v[i].x)!=grupa(v[i].y))
       {
           cost=cost+v[i].c;reun(v[i].x,v[i].y);
           p.push_back(i);
       }
        }
        fout<<cost<<"\n";
        fout<<n-1<<"\n";
        for(i=0;i<n-1;i++)
        {
            fout<<v[p[i]].x<<" "<<v[p[i]].y<<"\n";
        }
    return 0;
}