#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "apm";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

const int NMAX = 200000 + 5;
const int MMAX = 400000 + 5;

struct edge {
    int x, y, z;

    bool operator<(const edge &B) const {
        return z < B.z;
    }
};

int N, M, cost;
edge E[MMAX];
int root[NMAX];
bitset<MMAX> viz;

int find(int x) {
    if(root[x] != x) root[x] = find(root[x]);
    return root[x];
}

void unite(int x, int y) {
    root[x] = y;
}

int main() {
    int i, j, x, y, z;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    scanf("%d%d", &N, &M);

    for(i = 1; i <= M; i++)
        scanf("%d%d%d", &E[i].x, &E[i].y, &E[i].z);

    sort(E + 1, E + M + 1);

    for(i = 1; i <= N; i++)
        root[i] = i;

    for(i = j = 1; i <= N - 1 && j <= M; j++) {
        x = E[j].x;
        y = E[j].y;
        z = E[j].z;

        if(find(x) == find(y))
            continue;

        unite(find(x), find(y));

        cost += z;

        viz[j] = 1;

        i++;
    }

    printf("%d\n", cost);

    printf("%d\n", N - 1);

    for(i = 1; i <= M; i++)
        if(viz[i])
            printf("%d %d\n", E[i].x, E[i].y);

    return 0;
}