#include <bits/stdc++.h>

using namespace std;

ifstream fin("apm.in");
ofstream fout("apm.out");

const int NMax = 400005;

pair <int,int> P[NMax];
int n, m, Total, TT[200005], k, RG[200005];

struct muchie
{
    int x, y, cost;
}V[NMax];

bool Compare(muchie a, muchie b)
{
    return a.cost < b.cost;
}

void Read()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
        fin >> V[i].x >> V[i].y >> V[i].cost;
    sort(V + 1, V + m + 1, Compare);
}

int Find(int nod)
{
    while(TT[nod] != nod)
        nod = TT[nod];
    return nod;
}

void Unite(int x, int y)
{
    if(RG[x] < RG[y])
        TT[x] = y;
    if(RG[y] < RG[x])
        TT[y] = x;
    if(RG[x] == RG[y])
    {
        TT[x]=y;
        RG[y]++;
    }
}

void Solve()
{
    for(int i = 1; i <= m; i++)
    {
        int tatal_x = Find(V[i].x);
        int tatal_y = Find(V[i].y);
        if(tatal_x != tatal_y)
        {
            //cout << "Unesc " << V[i].x << " cu " << V[i].y << "\n\n";
            Unite(tatal_x, tatal_y);
            P[++k].first = V[i].x;
            P[k].second = V[i].y;
            Total += V[i].cost;
        }
    }
}

int main()
{
    Read();
    for(int i = 1; i <= m; i++)
    {
        TT[i] = i;
        RG[i] = 1;
    }
    Solve();
    fout << Total << "\n";
    fout << n - 1 <<"\n";
    for(int i = 1; i <= k; i++)
        fout << P[i].second << " " << P[i].first << "\n";
    return 0;
}