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

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

const int NMAX = 2 * (1e5);
const int MMAX = 4 * (1e5);

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

bool cmp(edge Edge1, edge Edge2)
{
    return Edge1.cost < Edge2.cost;
}

int father[NMAX + 5], sum;

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

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

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

    father[root1] = root2;
}

struct edge2
{
    int start, dest;
};
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 Edge;
        Edge.cost = cost;
        Edge.start = u;
        Edge.dest = v;

        edges[i] = Edge;
    }

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

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

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

            edge2 Edge;
            Edge.start = edges[i].start;
            Edge.dest = edges[i].dest;
            tree.push_back(Edge);
        }

    fout << sum << '\n' << n - 1 << '\n';
    for(auto Edge : tree)
        fout << Edge.start << ' ' << Edge.dest << '\n';

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