#include <fstream>
#include <algorithm>
#include <vector>
#define nMax 200005
#define mMax 400005
#define cost first
#define node1 second.first
#define node2 second.second
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
pair< int, pair<int, int> > Edges[mMax];
int Rad[nMax], n, m, Rez, i, value1, value2;
int getRoot(int node)
{
    return (Rad[node]<0) ? node : getRoot(Rad[node]);
}
vector<int> Ans;
int main()
{
    fin>>n>>m;
    for(i=1;i<=m;i++)
        fin>>Edges[i].node1>>Edges[i].node2>>Edges[i].cost;
    sort(Edges+1, Edges+m+1);
    for(i=1;i<=n;i++)
        Rad[i]=-1;
    for(i=1;i<=m;i++)
    {
        value1=getRoot(Edges[i].node1);
        value2=getRoot(Edges[i].node2);
        if(value1!=value2)
        {
            Rez+=Edges[i].cost;
            Rad[value1]=value2;
            Ans.push_back(i);
        }
    }
    fout<<Rez<<'\n'<<n-1<<'\n';
    for(i=0;i<n-1;i++)
        fout<<Edges[Ans[i]].node1<<" "<<Edges[Ans[i]].node2<<'\n';
    return 0;
}