#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#define NR 100000
using namespace std;
vector < pair <int,pair<int,int> > > G;
vector < pair <int,pair<int,int> > >::iterator it;
vector <pair <int,int> >k;
vector <pair <int,int> >::iterator it1;
int n,m,v[NR],in[NR],cost;
void citire()
{
    scanf("%d%d",&m,&n);
    int x,y,z;
    for(int i=1;i<=m;i++)
        {
            v[i]=i;
            in[i]=1;
        }
    for(int i=1; i<=n; i++)
    {
        scanf("%d%d%d",&x,&y,&z);
        G.push_back(make_pair(z,make_pair(x,y)));
    }
    sort(G.begin(),G.end());
}
int radacina(int i)
{
    while(i!=v[i])
    {
        i=v[i];
    }
    return i;
}
bool isNotCycle(int x,int y)
{
    if(radacina(x)==radacina(y)) return false;
    return true;
}
void intersectie(int x,int y)
{
    if(in[x]>=in[y])
    {
    //upadteTotal(x,radacina(y));
    v[radacina(y)]=radacina(x);
    in[x]=max(in[x],in[y]+1);
    in[y]=in[x];
    }
    else
    {
    //upadteTotal(y,radacina(x));
    v[radacina(x)]=radacina(y);
    in[y]=max(in[y],in[x]+1);
    in[x]=in[y];
    }
}
void solve()
{
    int nrmuchii=0;
    for(it=G.begin();it!=G.end()&&nrmuchii<=2*m-1;it++)
        if(isNotCycle(it->second.first,it->second.second))
        {
            intersectie(it->second.first,it->second.second);
            k.push_back(make_pair(it->second.first,it->second.second));
            cost+=it->first;
            nrmuchii++;
}
}

int main()
{
    freopen("apm.in","r",stdin);
    freopen("apm.out","w",stdout);

    citire();
    solve();
    printf("%d\n%d\n",cost,m-1);
    for(it1=k.begin();it1!=k.end();it1++)
    {
        printf("%d %d\n",it1->first,it1->second);
    }
    return 0;
}