#include <cstdio>
#include <vector>
#include <algorithm>
#define lim 200000
using namespace std;
int x[2 * lim],y[2*lim],c[2*lim],ind[2*lim];
int gr[lim];
struct cmp
{
    bool operator ()(const int &a, const int &b)const{
        return c[a]<c[b];
    }
};

int n,m;
void citire()
{
    scanf("%d %d",&n,&m);
        for(int i=1; i<=m ; i++)
            {
                scanf("%d %d %d",&x[i],&y[i],&c[i]);
                ind[i] = i;
            }

        sort(ind+1,ind+m+1,cmp());
}

int grupa (int i)
{
    if (gr[i] == i)
        return i;

    gr[i] = grupa(gr[i]);
    return gr[i];
}

void unite (int i,int j)
{
    gr[grupa(i)] = grupa(j);
}

vector <int> G;

int cost = 0;
void kruskal()
{
    for(int i=1;i<=n;i++)
        gr[i] = i;

    for(int i=1;i<=m;i++)
        {
                if(grupa(x[ind[i]]) != grupa (y[ind[i]]) )
                {
                    unite(x[ind[i]],y[ind[i]]);
                    cost += c[ind[i]];
                    G.push_back(ind[i]);
                }
        }


}

void afis()
{
    printf("%d\n%d\n",cost,G.size());
        for(int i=0;i<G.size();i++)
            {
                printf("%d %d\n",x[G[i]],y[G[i]]);
            }
}

int main()
{
    freopen("apm.in","r",stdin);
    freopen("apm.out","w",stdout);
    citire();
    kruskal();
    afis();
    return 0;
}