#include <cstdio>
#include <algorithm>
using namespace std;
struct drum
{
int nod1, nod2, cost;
};
drum v[400001], s[200001];
int tati[200001];
int i, n, m, costmin, nrsol;
bool cmp(const drum a, const drum b)
{
if(a.cost<b.cost)
return true;
return false;
}
int tata(int nod)
{
if(tati[nod]==nod)
return nod;
else
return tati[nod]=tata(tati[nod]);
}
void join(int nod, int node)
{
int rx, ry;
rx=tata(nod);
ry=tata(node);
tati[rx]=ry;
}
int main()
{
freopen("apm.in", "r", stdin);
freopen("apm.out", "w", stdout);
scanf("%d%d", &n, &m);
for(i=1; i<=n; i++)
tati[i]=i;
for(i=1; i<=m; i++)
scanf("%d%d%d", &v[i].nod1, &v[i].nod2, &v[i].cost);
sort(v+1, v+m+1, cmp);
i=1;
nrsol=1;
while(nrsol<n && i<=m)
{
if(tati[tata(v[i].nod1)]!=tati[tata(v[i].nod2)])
{
costmin=costmin+v[i].cost;
s[nrsol]=v[i];
join(s[nrsol].nod1, s[nrsol].nod2);
nrsol++;
}
i++;
}
nrsol--;
printf("%d\n%d\n", costmin, nrsol);
for(i=1; i<=nrsol; i++)
printf("%d %d\n", s[i].nod2, s[i].nod1);
return 0;
}