#include <fstream>
#include <iostream>
#include <set>
#include <vector>
#include <conio.h>
#define MAXN 200100
#define INF 1000000000
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");

int n , m , d[MAXN];
vector<int> g[MAXN],c[MAXN];
set < pair <int,int > > t;
bool used[MAXN];
int father[MAXN];
int edgecost[MAXN];
 
void prim()
{
     int i , val , x;
     int s=0;
     for(i=2 ; i<=n; i++) d[i]=INF;

     t.insert(make_pair(0,1));
     while(t.size()>0)
     {
                      val=(*t.begin()).first; 
                      x=(*t.begin()).second; 
                      t.erase(*t.begin());
                      used[x]=true;
                      for(i=0;i<g[x].size(); i++)
                      {
                       if( used[g[x][i]]==false && d[g[x][i]] > c[x][i])
                         {
                                      cout<<g[x][i]<<" "<<c[x][i]<<endl;
                                      d[g[x][i]]=c[x][i];
                                      t.insert(make_pair(d[g[x][i]],g[x][i]));
                                      father[g[x][i]]=x;
                                      edgecost[g[x][i]]=c[x][i];
                         }
                       }
     }
     s=0;
     for(i=1;i<=n;i++)
     if(father[i]!=0) s+=edgecost[i];
     fout<<s<<"\n";
     fout<<n-1<<"\n";
     for(int i=1 ; i<=n; i++)
        if(father[i]!=0)
            fout<<i<<" "<<father[i]<<"\n";
} 

int main()
{
    int i , a ,b , cost;
    fin>>n>>m;
    for(i=1; i<=m; i++) 
    {
             fin>>a>>b>>cost;
             g[a].push_back(b);
             c[a].push_back(cost);
             g[b].push_back(a);
             c[b].push_back(cost);
    }
    prim();
    getch();
}