#include <bits/stdc++.h>

using namespace std;

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

const int N = 2e5;

struct muchie
{
    int x, y, z;
};

vector <muchie> em;

muchie v[2 * N + 1];

int parent[N + 1];

int n,m;

int compar(muchie a, muchie b)
{
    return a.z < b.z;
}

int Find(int nod)
{
    if(nod == parent[nod])
        return nod;
    return parent[nod] = Find(parent[nod]);
}

int main()
{
    in >> n >> m;
    for(int i = 1; i <= n; i++)
        parent[i] = i;
    for(int i = 1; i <= m; i++)
    {
        in >> v[i].x >> v[i].y >> v[i].z;
    }
    sort(v + 1, v + m + 1, compar);
    int sum = 0;
    for(int i = 1; i <= m; i++)
    {
        int a = Find(v[i].x), b = Find(v[i].y);
        if(a != b)
        {
            parent[b] = a;
            sum += v[i].z;
            em.push_back({v[i].x, v[i].y, v[i].z});
        }
    }
    out << sum << '\n' << em.size() << '\n';
    for(auto X:em)
        out << X.x << ' ' << X.y << ' ' << X.z << '\n';
    return 0;
}