#include <fstream>
#include <queue>
#include <vector>
#define in "apm.in"
#define out "apm.out"
#define N 200003

using namespace std;

ifstream fin(in);
ofstream fout(out);

int n,m,x,y,c;
long long S = 0;
int comp[N]; // nodul i face parte din componenta comp[i]

priority_queue< pair<int, pair<int,int> > > coada;

vector< pair<int,int> > sol;

inline void schimba(int x1,int x2)
{
    for(int i=1; i<=n; ++i)
        if(comp[i] == x2) comp[i] = x1;
}

void APM()
{
    while(!coada.empty())
    {
        if(comp[coada.top().second.first] != comp[coada.top().second.second])
        {
            S += -coada.top().first;
            schimba(comp[coada.top().second.first] , comp[coada.top().second.second]); // elementele componentei drepte apartin componentei stangi acum
            sol.push_back(make_pair(coada.top().second.first , coada.top().second.second));
        }
        coada.pop();
    }
}

int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; ++i)
    {
        fin>>x>>y>>c;
        coada.push(make_pair(-c,make_pair(x,y)));
    }

    for(int i=1; i<=n; ++i)
        comp[i] = i;

    APM();

    fout<<S<<"\n"<<n-1<<"\n";

    for(int i=0; i<sol.size(); ++i)
        fout<<sol[i].first<<" "<<sol[i].second<<"\n";

    fin.close(); fout.close();
    return 0;
}