#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
///prim
using namespace std;
ifstream cin("apm.in");
ofstream cout("apm.out");

struct muchie
{
    int a,b,cost;
    bool operator < (muchie x)
        {
            return cost<x.cost;
        }
};
vector<muchie> muchii;
using PI = pair<int,int> ;
vector<PI> ans;
vector<vector<pair<int,int> > > sirad;
vector<int> t;
int Radacina(int x)
{
    int rad = x , y;
    while(t[rad]!=0)rad = t[rad];

    while(x!=rad)
    {
        y = t[x];
        t[x] = rad;
        x = y;
    }
    return rad;
}
void Unire(int rx,int ry)
{
    t[rx] = ry;
}

int main()
{
    int a,b,c,n,m;
    cin>>n>>m;
    sirad = vector<vector<pair<int,int>>>(n+1);
    t = vector<int>(n+1);
    while(m--)
    {
        cin>>a>>b>>c;
        muchii.push_back({a,b,c});
    }
    sort(muchii.begin(),muchii.end());
    long long sum = 0;
    for(auto i : muchii)
    {
        int a = i.a,
        b = i.b,
        c = i.cost;
        int ra = Radacina(a),
        rb = Radacina(b);
        if(ra!=rb)
        {
            Unire(ra,rb);
            sum+=c;
            ans.emplace_back(a,b);
        }
    }
    cout<<sum<<'\n';
    cout<<ans.size()<<'\n';
    for(auto i : ans)
        cout<< i.first<<' '<<i.second<<'\n';
    return 0;
}