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

using namespace std;

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

struct edge
{
    int st, dest, cost;
};
const int MMAX = 4 * (1e5);
const int NMAX = 2 * (1e5);
int father[NMAX + 5], depth[NMAX + 5];
edge edges[MMAX + 5];
vector <edge> tree;

bool cmp(edge edge1, edge edge2)
{
    return edge1.cost < edge2.cost;
}

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

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

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

    if(root1 == root2)
        return;

    if(depth[root1] == depth[root2])
    {
        depth[root1]++;
        father[root2] = root1;
    }
    else if(depth[root1] < depth[root2])
        father[root1] = root2;
    else father[root2] = root1;
}

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

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

    for(int i = 1; i <= m; i++)
    {
        int x, y, c;
        fin >> x >> y >> c;

        edge e;
        e.st = x;
        e.dest = y;
        e.cost = c;

        edges[i] = e;
    }

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

    long long s = 0;
    for(int i = 1; i <= m; i++)
        if(findrt(edges[i].st) != findrt(edges[i].dest))
        {
            s += edges[i].cost;
            Union(edges[i].st, edges[i].dest);

            tree.push_back(edges[i]);
        }

    fout << s << '\n' << n - 1 << '\n';

    for(auto e : tree)
        fout << e.st << ' ' << e.dest << '\n';

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