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

using pii = pair<int, pair<int, int>>;

ifstream fin("apm.in");
ofstream fout("apm.out");
vector<pii> v;
int dad[200005];
int find(int x)
{
    if (x == dad[x])
    {
        return x;
    }
    return dad[x] = find(dad[x]);
}
int main()
{
    int n, m;
    fin >> n >> m;
    for (int i = 0; i < m; i++)
    {
        int a, b, c;
        fin >> a >> b >> c;
        v.push_back({c, {a, b}});
    }
    sort(v.begin(), v.end());
    for (int i = 1; i <= n; i++)
    {
        dad[i] = i;
    }
    int cost = 0;
    vector<pair<int, int>> p;
    for (int i = 0; i < m; i++)
    {
        int a = v[i].second.first;
        int b = v[i].second.second;
        int c = v[i].first;

        int da = find(a);
        int db = find(b);
        if (da != db)
        {
            cout << a << " " << b << " " << da << " " << db << '\n';
            p.push_back({a, b});

            dad[db] = da;

            cost += c;
        }
    }
    fout << cost << '\n'
         << n - 1 << '\n';
    for (auto i : p)
    {
        fout << i.first << " " << i.second << '\n';
    }
    return 0;
}