#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
#define N 1000005
ifstream cin("apm.in");
ofstream cout("apm.out");
vector < pair < int, int > > V;
vector < pair < int , int > > SolEdges;
int P[N],n,m,PutEdges,Sum;
int Find(int nod)
{
    if(P[nod]==nod)
        return nod;
    else
        Find(P[nod]);
}
bool Union(int x, int y)
{
    if(Find(x)==Find(y))
        return false;
    else
    {
        P[x]=Find(x);
        P[y]=Find(y);
        P[P[x]]=P[y];
        return true;
    }
}
struct muchii
{
    int x,y,c;
} Edges[N];

int main()
{
    int i,c,x,y,a,b;
    cin>>n>>m;
    for(i=1; i<=n; i++)
        P[i]=i;
    for(i=1; i<=m; i++)
    {
        cin>>Edges[i].x>>Edges[i].y>>Edges[i].c;
        V.push_back({Edges[i].c,i});
    }
    sort(V.begin(),V.end());
    for(i=0; i<m && PutEdges<n-1; i++)
    {
        x=Edges[V[i].second].x;
        y=Edges[V[i].second].y;
        c=Edges[V[i].second].c;
        if(Union(x,y)==true)
        {
            Sum+=c;
            SolEdges.push_back({x,y});
            //cout<<x<<" "<<y<<'\n';
            PutEdges++;
        }
    }
    cout<<Sum<<'\n';
    cout<<SolEdges.size()<<'\n';
    for(i=0;i<SolEdges.size();i++)
        cout<<SolEdges[i].first<<" "<<SolEdges[i].second<<'\n';
    return 0;
}