#include <iostream>
#include <vector>
#include <bitset>
#include <fstream>
#include <queue>
#include <algorithm>

using namespace std;

int n, m;

struct muchie
{
    int x, y, c;
    bool operator < (const muchie& other) const
    {
        return (*this).c < other.c;
    }
}E[400001];

void Read()
{
    ifstream fin("apm.in");
    fin >> n >> m;
    for (int i = 1; i <= m; i++)
        fin >> E[i].x >> E[i].y >> E[i].c;
}

int t[200001], r[200001];

void Union(int x, int y)
{
    if (r[x] > r[y])
        t[y] = x;
    else
    {
        t[x] = y;
        if (r[x] == r[y])
            r[y]++;
    }
}

int Find(int x)
{
    if (t[x] == 0)
        return x;
    int y = Find(t[x]);
    t[x] = y;
    return y;
}

void Kruskal()
{
    sort(E + 1, E + m + 1);
    vector <pair<int, int> > sol;
    int totalcost = 0;
    for (int i = 1; i <= m; i++)
    {
        int x = Find(E[i].x);
        int y = Find(E[i].y);
        if (x != y)
        {
            totalcost += E[i].c;
            sol.push_back({ E[i].x, E[i].y });
            Union(x, y);
        }
    }
    ofstream fout("apm.out");
    fout << totalcost << "\n" << sol.size() << "\n";
    for (int i = 0; i < sol.size(); i++)
        fout << sol[i].first << " " << sol[i].second << "\n";
}

int main()
{
    Read();
    Kruskal();
    return 0;
}