#include <iostream>
#include <fstream>
#include <climits>
#include <vector>
#include <set>
using namespace std;
ifstream in("apm.in");
ofstream out("apm.out");
const int Max=200005;
vector < pair < int , int > > v[Max];
int n,m,dist[Max],Min,cost,S,D,tata[Max],nr;
set < pair < int , int > >c;
bool viz[Max];
void citire()
{
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,z;
        in>>x>>y>>z;
        v[x].push_back(make_pair(y,z));
        v[y].push_back(make_pair(x,z));
    }
}
void Prim()
{

    viz[1]=1;
  for(int k=1;k<=n-1;k++)
   {
       Min=INT_MAX;
       for(int i=1;i<=n;i++)
        if(viz[i]==1)
        for(int q=0;q<v[i].size();q++)
       {
           int nod=v[i][q].first;
           int d=v[i][q].second;
           if(viz[nod]==0 && Min>d)
           {
               Min=d;
               S=i;
               D=nod;
           }
       }
          viz[D]=1;
         tata[D]=S;
          cost=cost+Min;
          nr++;

   }
    out<<cost<<"\n";
    out<<nr<<"\n";
    for(int i=2;i<=n;i++)
        if(tata[i]!=0)
    out<<tata[i]<<" "<<i<<"\n";
}
int main()
{
   citire();
   Prim();
    return 0;
}