//horatiu11
# include <cstdio>
# include <algorithm>
# define mmax 400001
using namespace std;
int l[mmax],n,m,cost,k;
struct muchie{int x,y,c;}u[mmax],sol[mmax];
inline bool cmp(muchie a, muchie b)
{
    return a.c<b.c;
}
inline void apm()
{
    int i=1,j,nr1,nr2;
    k=0;cost=0;
    while(k<n-1)
    {
        if(l[u[i].x]!=l[u[i].y])
        {
            sol[++k]=u[i];
            cost+=u[i].c;
            nr1=l[u[i].x];nr2=l[u[i].y];
            for(j=1;j<=n;++j)
                if(l[j]==nr2)l[j]=nr1;
        }
        ++i;
    }
}
int main()
{
    int i;
    freopen("apm.in","r",stdin);
    freopen("apm.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;++i)
    {
        scanf("%d%d%d",&u[i].x,&u[i].y,&u[i].c);
        l[i]=i;
    }
    sort(u+1,u+m+1,cmp);
    apm();
    printf("%d\n%d\n",cost,k);
    for(i=1;i<=k;++i)
        printf("%d %d\n",sol[i].x,sol[i].y);
    return 0;
}