#include <bits/stdc++.h>

using namespace std;
ifstream in("apm.in");
ofstream out("apm.out");
int n,m,i,j,x,y,ap[200005],val[200005],poz,cost,sol,d[200005];
vector <pair <int,int > > v[200005],s;
void df (int x)
{
    int i,nod,cost,minim;
    ap[x]=1;
    for (i=0;i<v[x].size();i++)
    {    nod=v[x][i].first;
        cost=v[x][i].second;
        if (val[nod]>cost)
        {
            val[nod]=cost;
            d[nod]=x;
        }
    }
    poz=0;
    minim=INT_MAX;
    for (i=1;i<=n;i++)
    { if (ap[i]==0&&val[i]<minim)
        {    minim=val[i];            poz=i;
        }
    }
    if (poz!=0)
    {        sol+=minim;
        s.push_back({poz,d[poz]});
   df(poz);
    }
}
int main()
{    in>>n>>m;
    for (i=1;i<=m;i++)
    {   in>>x>>y>>cost;
        v[x].push_back({y,cost});
        v[y].push_back({x,cost});
    }
    for (int i=1;i<=n;i++){  val[i]=INT_MAX;}
    val[1]=0;
    df(1);
    out<<sol<<'\n';
    out<<s.size()<<'\n';
    for (int i=0;i<s.size();i++){out<<s[i].first<<" "<<s[i].second<<'\n';}
    return 0;
}