#include <cstdio>
#include <vector>
#include <utility>
#include <algorithm>
#define N 200010
#define E 400010
using namespace std;
vector<int> X,Y;
int n,m,x,y,c,i,cnt,Cst,T[N];
pair<int,pair<int,int> > M[E];
int main()
{
    freopen("apm.in","r",stdin);
    freopen("apm.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)T[i]=i;
    for(i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&y,&c);
        M[i]=make_pair(c,make_pair(x,y));
    }
    sort(M+1,M+m+1);
    for(i=1,cnt=n-1;cnt;i++)
    {
        c=M[i].first;
        x=M[i].second.first;
        y=M[i].second.second;
        for(;;)
        {
            X.push_back(x);
            if(T[x]==x)break;
            x=T[x];
        }
        for(;;)
        {
            Y.push_back(y);
            if(T[y]==y)break;
            y=T[y];
        }
        if(x!=y){Cst+=c;M[i].first=1001;x=y;cnt--;}
        for(;X.size();X.pop_back())T[X.back()]=x;
        for(;Y.size();Y.pop_back())T[Y.back()]=y;
    }
    printf("%d\n%d\n",Cst,n-1);
    for(i=1,cnt=n-1;cnt;i++)
        if(M[i].first==1001)
        {
            cnt--;
            printf("%d %d\n",M[i].second.first,M[i].second.second);
        }
    return 0;
}