#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

struct edge
{
    int x,y,c;
    bool operator <(const edge &aux) const
    {
        return c<aux.c;
    }
}muc[400010];
vector<int> sol;
int rad[200010],h[200010];

int radacina(int x)
{
    int y=x;
    for(;x!=rad[x];x=rad[x]);
    while(y!=x)
    {
        int aux=rad[y];
        rad[y]=x;
        y=aux;
    }
    return x;
}

int main()
{
    freopen("apm.in", "r", stdin);
    freopen("apm.out", "w", stdout);
    int n,m,sum=0;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++) scanf("%d%d%d",&muc[i].x,&muc[i].y,&muc[i].c);
    sort(muc+1,muc+1+m);
    for(int i=1;i<=n;i++) {rad[i]=i;h[i]=1;}
    for(int i=1;i<=m;i++)
    {
        int x=radacina(muc[i].x),y=radacina(muc[i].y);
        if(x!=y)
        {
            if(h[x]<h[y]) swap(x,y);
            rad[y]=x;
            if(h[x]==h[y]) h[x]++;
            sol.push_back(i);
            sum+=muc[i].c;
        }
    }
    printf("%d\n%d\n",sum,sol.size());
    for(int i=0;i<sol.size();i++) printf("%d %d\n",muc[sol[i]].x,muc[sol[i]].y);
    return 0;
}