#include <bits/stdc++.h>
using namespace std;

const int MAX = 200005;
int parent[MAX], check[MAX];

struct APM {
    int x, y, c;
} a[MAX];

bool cmp(APM A, APM B)
{
    return A.c < B.c;
}

void Union(int x, int y)
{
    parent[y] = x;
}

int FindRoot(int x)
{
    int rad = x;
    while (parent[rad] != 0)
        rad = parent[rad];

    while (rad != x)
    {
        int y = parent[x];
        parent[x] = rad;
        x = y;
    }

    return rad;
}

int main()
{
    ifstream cin("apm.in");
    ofstream cout("apm.out");
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= m; ++i)
        cin >> a[i].x >> a[i].y >> a[i].c;

    sort(a+1, a+m+1, cmp);
    int costTotal = 0, nrc = n, cnt = 0;
    for (int i = 1; i <= m && nrc > 1; ++i)
    {
        int x = FindRoot(a[i].x);
        int y = FindRoot(a[i].y);
        if (x != y)
        {
            Union(x, y);
            costTotal += a[i].c;
            check[i] = 1;
            ++cnt;
            --nrc;
        }
    }

    cout << costTotal << "\n" << cnt << "\n";
    for (int i = 1; i <= m; ++i)
        if (check[i])
            cout << a[i].x << " " << a[i].y << "\n";

    return 0;
}