#include<vector>
#include<algorithm>
#include <fstream>
#include <iostream>
#define maxim 200000
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
int n,m,s=0,x,c,y,a[maxim],k=0;
std::vector <pair<int,pair<int,int> > > vact;
std::vector <int> vect1[maxim];
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        a[i]=i;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        vact.push_back(make_pair(c,make_pair(x,y)));
    }
             for(int i=1;i<=n;i++)
        a[i]=i;
    sort(vact.begin(),vact.end());
    int s=0;
    for(int i=0;i<m;i++)
    {
      x=vact[i].second.first;
      y=vact[i].second.second;
      if(a[x]!=a[y])
        {
            if(vect1[a[y]].size()!=0)
            {
                int aux=a[y];
                for(int j=1;j<=n;j++)
                        {
                            if(a[j]==aux)
                            a[j]=a[x];}
            }
            else
            a[y]=a[x];
              vect1[x].push_back(y);
            s=s+vact[i].first;
            k++;

        }
    }
    fout<<s<<"\n";
    fout<<k<<"\n";
    for(int i=1;i<=n;i++)
    {
             for(int j=0;j<vect1[i].size();j++)
                  fout<<i<<" "<<vect1[i][j]<<"\n";
    }
    return 0;
}