#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#define Nmax 200000

using namespace std;

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

vector<pair<pair<int,int>,int>> g;
vector<pair<int,int>> sol;
int TT[Nmax],rang[Nmax];
int n,m,sum,x,y,c;

int Find(int Node)
{
    if(TT[Node]==Node)
        return Node;
    else
        return Find(TT[Node]);
}

void Unite(int x , int y)
{
    if(rang[x]<rang[y])
            swap(x,y);
    if(rang[x]==rang[y])
        rang[x]++;
    TT[y]=x;
}

int main()
{
    fin>>n>>m;

    for(int i=1;i<=n;i++)
    {
        TT[i]=i;
    }

    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        g.push_back(make_pair(make_pair(x,y),c));
    }

    sort(g.begin(),g.end(), [](auto &left ,  auto &right)
         {
             return left.second<right.second;
         });

    for(auto i : g)
    {
        int a =  Find(i.first.first);
        int b =  Find(i.first.second);

        if(a != b)
        {
            sum += i.second;
            sol.push_back(make_pair(i.first.first,i.first.second));
            Unite(a,b);
        }
    }

    fout << sum << '\n';
    fout << sol.size() << '\n';
    for(auto i  : sol)
    {
        fout << i.first << " " << i.second << '\n';
    }
    return 0;
}