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

using namespace std;
ifstream fin ("apm.in");
ofstream fout ("apm.out");
const int NMAX = 200000;
const int MMAX = 400000;

int father[NMAX + 5];
struct edge
{
    int start, dest, cost;
};
edge edges[MMAX + 5];

bool cmp(edge e1, edge e2)
{
    return e1.cost < e2.cost;
}

int findrt(int node)
{
    if(node == father[node])
        return node;

    return father[node] = findrt(father[node]);
}

void union_update(int node1, int node2)
{
    int root1 = findrt(node1), root2 = findrt(node2);

    father[root1] = root2;
}

struct edge2
{
    int first, second;
};
vector <edge2> tree;

int main()
{
    int n , m;
    fin >> n >> m;

    for(int i = 1; i <= m; i++)
    {
        int u, v, cost;
        fin >> u >> v >> cost;

        edge e;
        e.start = u;
        e.dest = v;
        e.cost = cost;

        edges[i] = e;
    }

    sort(edges + 1, edges + m + 1, cmp);

    for(int i = 1; i <= n; i++)
        father[i] = i;

    int sum = 0;
    for(int i = 1; i <= m; i++)
        if(findrt(edges[i].start) != findrt(edges[i].dest))
        {
            sum += edges[i].cost;
            union_update(edges[i].start, edges[i].dest);

            edge2 e;
            e.first = edges[i].start;
            e.second = edges[i].dest;
            tree.push_back(e);
        }

    fout << sum << '\n' << n - 1 << '\n';
    for(auto node_pair : tree)
        fout << node_pair.first << ' ' << node_pair.second << '\n';

    fin.close();
    fout.close();
    return 0;
}