#include <bits/stdc++.h>
#define MAX 200200
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
struct muchie{
int x,y,cost;};
inline bool operator <(muchie a,muchie b)
{
    return a.cost>b.cost;
}
vector<muchie>sol;
priority_queue<muchie>pq;
void rd();
void Union(int x,int y);
int Find(int x);
void Kruskal();
int tata[MAX],h[MAX];
int n,m,costmin;
int main()
{
    int i;
    rd();
    Kruskal();
    fout<<costmin<<'\n';
    fout<<sol.size()<<'\n';
    for(i=0;i<sol.size();i++)
        fout<<sol[i].x<<' '<<sol[i].y<<'\n';
    return 0;
}
void rd()
{
    int i,x,y,z;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>z;
        pq.push({x,y,z});
    }

}
void Union(int x,int y)
{
    if(h[y]>h[x])
        tata[x]=y;
    else
    {
        tata[y]=x;
        if(h[x]==h[y])
            h[x]++;
    }
}
int Find(int x)
{
    int rad,y;
    rad=x;
    while(tata[rad])
        rad=tata[rad];
    while(tata[x])
    {
        y=tata[x];
        tata[x]=rad;
        x=y;
    }
    return rad;
}
void Kruskal()
{
    muchie a;
    int nrsel=0,c1,c2;
    while(nrsel<n-1)
    {
        a=pq.top();
        pq.pop();
        c1=Find(a.x);
        c2=Find(a.y);
        if(c1!=c2)
        {
            nrsel++;
            sol.push_back(a);
            costmin+=a.cost;
            Union(c1,c2);
        }
    }
}