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

int sef[100001];

struct muchie
{
    int x,y,c;
}muc[400001];

vector <int> sol;

bool cmp(muchie a, muchie b)
{
    return a.c<b.c;
}

int boss(int x)
{
    if(sef[x]==x)
        return x;
    else
        return sef[x]=boss(sef[x]);
}

void unire(int x,int y)
{
    int sx=boss(x);
    int sy=boss(y);
    sef[sy]=sx;
}

int main()
{
    int n,m,cost=0;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        sef[i]=i;
    for(int i=1;i<=m;i++)
        cin>>muc[i].x>>muc[i].y>>muc[i].c;
    sort(muc+1,muc+m+1,cmp);
    for(int i=1;i<=m;i++)
    {
        if(boss(muc[i].x)!=boss(muc[i].y))
        {
            unire(muc[i].x,muc[i].y);
            cost+=muc[i].c;
            sol.push_back(i);
            if(sol.size()==n-1)
                break;
        }
    }
    cout<<cost<<'\n'<<n-1<<'\n';
    for(int i=0;i<sol.size();i++)
        cout<<muc[sol[i]].x<<" "<<muc[sol[i]].y<<'\n';
    return 0;
}