#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

struct Edge {
    int x, y, w;
    friend bool operator < (const Edge& a, const Edge& b)
    {
        return a.w < b.w;
    }
};

using VE = vector<Edge>;
using VI = vector<int>;

int n, m, k, cost;
VE G, arb;
VI t, h;

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

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

void Write()
{
    ofstream fout("apm.out");
    fout << cost << '\n' << k << '\n';
    for (const Edge& e : arb)
        fout << e.x << ' ' << e.y << '\n';
    fout.close();
}

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)
        {
            k++;
            arb.push_back(e);
            cost += e.w;
            Union(c1, c2);
            if (k == n - 1)
                break;
        }
    }
}

int Find(int x)
{
    if (x == t[x])
        return x;
    return t[x] = Find(t[x]);
}

void Union(int x, int y)
{
    if (h[x] < h[y])
        t[x] = y;
    else
    {
        t[y] = x;
        if (h[x] == h[y])
            h[x]++;
    }
}

void Read()
{
    ifstream fin("apm.in");
    fin >> n >> m;
    t = h = VI(n + 1);
    for (int i = 1; i <= n; i++)
        t[i] = i;
    int x, y, w;
    for (int i = 0; i < m; i++)
    {
        fin >> x >> y >> w;
        G.push_back({x, y, w});
    }
    fin.close();
}