#include<bits/stdc++.h>
using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");

const int NMAX = 200000;
struct ceva
{
    int x,y,z;
}v[NMAX+5];
int t[NMAX+5];
int n,m,s=0;

vector<pair<int,int>>apm;

int cmp(ceva a, ceva b)
{
    return a.z<b.z;
}

int root(int x)
{
    int copie = x;
    while(t[x]>=0)
        x=t[x];
    while(copie!=x)
    {
        int copie2 = t[copie];
        t[copie] = x;
        copie =  copie2;
    }
    return x;
}

void Union(int a, int b)
{
    int r1 = root(a);
    int r2 = root(b);
    if(r1!=r2)
    {
        if(t[r1]<t[r2])
            t[r2]+=t[r1],t[r1]=r2;
        else
            t[r1]+=t[r2],t[r2]=r1;
    }
}

int main()
{
    int i;
    f>>n>>m;
    for(i=1;i<=m;i++)
        f>>v[i].x>>v[i].y>>v[i].z;
    sort(v+1,v+m+1,cmp);
    for(i=1;i<=n;i++)
        t[i]=-1;
    for(i=1;i<=m;i++)
    {
        if(root(v[i].x) != root(v[i].y))
        {
            Union(v[i].x,v[i].y);
            apm.push_back({v[i].x,v[i].y});
            s+=v[i].z;
        }
    }
    g<<s<<'\n'<<apm.size()<<'\n';
    for(auto it:apm)
        g<<it.first<<" "<<it.second<<'\n';
    return 0;
}