#include <bits/stdc++.h>
#define nmax 200000
using namespace std;
ifstream in("apm.in");
ofstream out("apm.out");
//sortam muchiile cresc dupa cost
//algoritm greedy: pentru n-1 muchii, luam muchia de cost minim astfel incat sef_suprem (nod1)!=sef_suprem(nod2)
struct muchie
{
    int x,y;
    int cost;
};
int e=0,sef[nmax+1],n,m,total=0;
muchie sol[nmax+1];
vector <muchie> costuri;
bool cmp(muchie a,muchie b) { return a.cost<b.cost; }
int sef_suprem(int nod)
{
    if(sef[nod]==nod) return nod;
    sef[nod]=sef_suprem(sef[nod]);
    return sef[nod];
}
void onion (int x, int y)
{
    int sefx=sef_suprem(x);
    int sefy=sef_suprem(y);
    sef[sefx]=sefy;
}
void kruskal()
{
    int cnt=0;
    for(muchie x:costuri)
    {
        if(sef_suprem(x.x)!=sef_suprem(x.y))
        {
            cnt++;
            total+=x.cost;
            sol[++e]=x;
            onion(x.x,x.y);
        }
        if(cnt==n-1) return;
    }
}
int main()
{
    in>>n>>m;
    muchie temp;
    for(int i=1;i<=m;i++)
    {
        in>>temp.x>>temp.y>>temp.cost;
        costuri.push_back(temp);
    }
    for(int i=1;i<=n;i++) sef[i]=i;
    sort(costuri.begin(),costuri.end(),cmp);
    kruskal();
    out<<total<<'\n'<<n-1<<'\n';
    for(int i=1;i<=e;i++) out<<sol[i].y<<' '<<sol[i].x<<'\n';
    return 0;
}