#include <cstdio>
#include <algorithm>
#include <vector>

using namespace std;
FILE *fin, *fout;

int n, m;

struct edge
{
    int start, dest, cost;
};

const int NMAX = 200000;
edge edges[NMAX + 5];

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

int father[NMAX + 5];

vector <edge> rez;
int s;

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;
}

int main()
{
    fin = fopen("apm.in", "r");
    fout = fopen("apm.out", "w");

    fscanf(fin, "%d%d", &n, &m);

    for(int i = 1; i <= m; i++)
    {
        fscanf(fin, "%d%d%d", &edges[i].start, &edges[i].dest, &edges[i].cost);
    }

    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))
        {
            s += edges[i].cost;

            union_update(edges[i].start, edges[i].dest);

            rez.push_back(edges[i]);
        }
    }

    fprintf(fout, "%d\n%d\n", s, n - 1);

    for(auto e : rez)
    {
        fprintf(fout, "%d %d\n", e.start, e.dest);
    }

    fclose(fin);
    fclose(fout);
    return 0;
}