#include<cstdio>
#include<algorithm>
using namespace std;
int j,x1,y1,n,m,s,i,nr,t[200002],poz[200002],h[200002];
struct str
{
	int x,y;
	short c;
};
str a[400002];
bool cmp(str a,str b)
{
	return a.c<b.c;
}
int tata(int x)
{
	if(t[x]!=0) t[x]=tata(t[x]);
	return t[x];
}
int main()
{
freopen("apm.in","r",stdin);
freopen("apm.out","w",stdout);
scanf("%d",&n);
scanf("%d",&m);
for(i=1;i<=n;i++)
{
	h[i]=1;
	t[i]=i;
}
for(i=1;i<=m;i++)
	scanf("%d %d %d",&a[i].x,&a[i].y,&a[i].c);
sort(a+1,a+m+1,cmp);
for(i=1;i<=m;i++)
{
	x1=tata(a[i].x);
	y1=tata(a[i].y);
	if(x1!=y1)
	{
		if(h[x1]<h[y1]) t[x1]=y1;
		else t[y1]=x1;
		if(h[x1]==h[y1]) h[y1]++;
		nr++;
		poz[nr]=i;
		s=s+a[i].c;
		if(nr==n-1) break;
	}
}
printf("%d\n",s);
printf("%d\n",nr);
for(i=1;i<=nr;i++)
	printf("%d %d\n",a[poz[i]].x,a[poz[i]].y);
return 0;
}