#include <fstream>
#include <vector>
#include <algorithm>

#define nMax 200001
#define mMax 400001
#define pb push_back
#define mkp make_pair

using namespace std;

ifstream fin("apm.in");
ofstream fout("apm.out");

int n, m, nrEdges, solApm;
int Root[nMax];
pair<int, pair<int, int> > edge[mMax];
pair<int, int> solEdges[nMax];

int getRoot(int node)
{
    return (Root[node]<0 ? node : Root[node]=getRoot(Root[node]));
}

int main()
{
    int a, b, c;
    fin>>n>>m;
    for(int i=1; i<=n; i++)
        Root[i]=-1;
    for(int i=1; i<=m; i++)
        fin>>edge[i].second.first>>edge[i].second.second>>edge[i].first;
    sort(edge+1, edge+m+1);

    for(int i=1; i<=m; i++)
    {
        int val1=getRoot(edge[i].second.first);
        int val2=getRoot(edge[i].second.second);
        if(val1!=val2)
        {
            switch(Root[val1]-Root[val2]<0)
            {
                case 1: Root[val1]+=Root[val2]; Root[val2]=val1; break;
                default: Root[val2]+=Root[val1]; Root[val1]=val2;
            }
            solApm+=edge[i].first;
            solEdges[++nrEdges]=edge[i].second;
        }
    }
    fout<<solApm<<'\n'<<nrEdges<<'\n';
    for(int i=1; i<=nrEdges; i++)
        fout<<solEdges[i].first<<" "<<solEdges[i].second<<'\n';
}