#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

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

const int NMAX = 200000 + 5;

struct muchie
{
    int from, to, cost;

    bool operator < (const muchie other) const
    {
        return cost < other.cost;
    }
};

int N, M;
int dad[NMAX], rnk[NMAX];
vector <muchie> v;

long long APM;
vector <muchie> apmEdges;

int GetRoot(int node)
{
    int initNode = node, p = dad[node];

    while(node != p)
    {
        node = p;
        p = dad[p];
    }

    dad[initNode] = p;
    return p;
}

void Join(int x, int y)
{
    int p = GetRoot(x);
    int q = GetRoot(y);

    if(rnk[p] == rnk[q])
    {
        rnk[p]++;
        dad[q] = p;
    }
    else if(rnk[p] > rnk[q])
        dad[q] = p;
    else
        dad[p] = q;
}

int main()
{
    fin >> N >> M;

    for(int i = 1; i <= N; i++)
        dad[i] = i;

    muchie m;
    for(int i = 1; i <= M; i++)
    {
        fin >> m.from >> m.to >> m.cost;
        v.push_back(m);
    }

    sort(v.begin(), v.end());

    for(int i = 0; i < M; i++)
    {
        int node1 = v[i].from;
        int node2 = v[i].to;

        if(GetRoot(node1) != GetRoot(node2))
        {
            APM += v[i].cost;
            apmEdges.push_back(v[i]);
            Join(node1, node2);
        }
    }

    fout << APM << '\n' << N - 1 << '\n';
    for(auto it : apmEdges)
        fout << it.from << ' ' << it.to << '\n';

    return 0;
}