#include <bits/stdc++.h>
#define for0(i, n) for(int i = 0; i < n; i++)
#define for1(i, n) for(int i = 1; i <= n; i++)
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define V vector<int>
#define VP vector<pair<int, int> >
#define clr(A, x) memset(A, x, sizeof(A))
#define cpy(A, B) memcpy(A, B, sizeof(B))
#define g(s) getline(cin, s) ///ai grija la fin/cin ///
#define FASTIO ios_base::sync_with_stdio(0)
const long long INFLL = (1LL<<62);
const int INFINT = 2000000000;
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
/*template <typename T>
string to_string(const T& n){
    ostringstream os;
    os << n;
    return os.str();
}
*/
/*void invers_modular(int a, int b, int &d, int &x, int &y)
{
    if(!b)
    {
        d=a;
        x=1;
        y=0;
        return ;
    }
    int x0, y0;
    invers_modular(b, a%b, d, x0, y0);
    x=y0;
    y=x0-a/b*y0;
}*/ // daca x<0 se aduna cu mod pana e mai mare, x fiind rezultatul

/*ull putere(ull baza, ull exponent, ull MOD)
{
    if(exponent == 0) return 1;
    if(exponent % 2 == 0) return putere((baza * baza) % MOD, exponent / 2, MOD) % MOD;
    return ((baza % MOD) * (putere(baza, exponent - 1, MOD) % MOD) % MOD);
}*/
ifstream fin("apm.in"); /// modifica cu numele corespunzator
ofstream fout("apm.out"); /// modifica cu numele corespunzator

const int MMAX = 4 * 1e5 + 1;
const int NMAX = 2 * 1e5 + 1;

int n, m;
vector<pair<pair<int, int>, int > > graf;

bool cmp(pair<pair<int, int>, int> p1, pair<pair<int, int>, int> p2)
{
    return p1.second < p2.second;
}

int tata[NMAX];
int gasim_tatal(int fiu)
{
    if(tata[fiu] != fiu)
        tata[fiu] = gasim_tatal(tata[fiu]);
    return tata[fiu];
}

int solsum = 0;
VP sol;

int main()
{
    fin >> n >> m;
    for1(i, m)
    {
        int a, b, c;
        fin >> a >> b >> c;
        graf.pb({{min(a, b), max(a, b)}, c});
    }
    sort(all(graf), cmp);
    for1(i, n)
        tata[i] = i;

    for(auto i: graf)
    {
        int a = i.first.first;
        int b = i.first.second;
        int cost = i.second;

        int tata_a = gasim_tatal(a);
        int tata_b = gasim_tatal(b);

        if(tata_a != tata_b)
        {
            tata[tata_b] = tata_a;
            solsum += cost;
            sol.pb({a, b});
        }
    }

    fout << solsum << '\n' << sol.size() << '\n';
    for(auto i: sol)
        fout << i.first << ' ' << i.second << '\n';


    return 0;
}