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

using namespace std;

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

struct Edge
{
    int x, y, w;

    bool operator < (const Edge& e) const ///graful se sorteaza in functie de costul fiecarei muchii
    {
        return w < e.w;
    }
};

int N, M;
vector<Edge> G;
vector<int> tata, h;
vector<Edge> apm;
int cnt; ///nr de muchii din apm
int cost_minim;

void Read();
void Union(int x, int y);
int Find(int x);
void Kruskal();

int main()
{
    Read();
    Kruskal();

    fout << cost_minim << '\n';
    fout << cnt << '\n';

    for(const Edge& e : apm)
        fout << e.x << " " << e.y << '\n';

    fout.close();
    return 0;
}

void Read()
{
    fin >> N >> M;
    tata = vector<int>(N + 1);
    h = vector<int>(N + 1);

    for(int i = 1; i <= N; ++i)
        h[i] = 0, tata[i] = i;

    while(M--)
    {
        int x, y, cost;
        fin >> x >> y >> cost;
        G.push_back({x, y, cost});
    }
    fin.close();
}
void Union(int x, int y)
{
    if (h[y] > h[x])
        tata[x] = y;
    else
    {
        tata[y] = x;
        if (h[x] == h[y])
            ++h[x];
    }
}
int Find(int x)
{
    if (x == tata[x]) return x;
    return tata[x] = Find(tata[x]);
}
void Kruskal()
{
    sort(G.begin(), G.end());

    int c1, c2;

    for (const Edge& e : G)
    {
        c1 = Find(e.x);
        c2 = Find(e.y);

        if (c1 != c2)
        {
            cost_minim += e.w;
            apm.push_back(e);
            Union(c1, c2);
            ++cnt;

            if (cnt == N - 1) break;

        }
    }
}