#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <stack>
#define NMAX 10000001
using namespace std;
ifstream fin ("apm.in");
ofstream fout ("apm.out");
int n,m,X[400005],Y[400005],C[400005],GR[400005],IND[400005],ans;
vector <int> sol;

int grupa(int x)
{
    if(GR[x]==x) return x;
    GR[x] = grupa(GR[x]);
    return GR[x];
}

int unite(int x, int y)
{
    GR[grupa(x)] = grupa(y);
}

bool cmpf(int i, int j)
{
    return (C[i] < C[j]);
}

int main()
{
    fin >> n>> m;
    for(int i=1;i<=m;++i)
    {
        fin >> X[i];
        fin >> Y[i];
        fin >> C[i];
        IND[i]=i;
    }
    for(int i=1;i<=n;++i) GR[i]=i;
    sort(IND + 1,IND + m + 1,cmpf);
    for(int i=1;i<=m;++i)
    {
        if(grupa(X[IND[i]])!=grupa(Y[IND[i]]))
        {
            ans += C[IND[i]];
            unite(X[IND[i]],Y[IND[i]]);
            sol.push_back(IND[i]);
        }
    }
    fout << ans << '\n' << n-1 << '\n';
    for(int i=0;i<n-1;++i)
        fout << X[sol[i]] << " " << Y[sol[i]] << '\n';
    return 0;
}