#include <cstdio>
#include <vector>
#include <queue>
#include <bitset>

using namespace std;

const int nmx = 200002;

int n,m;
int total;
vector <pair<int,int> > g[nmx], muchii;
priority_queue <pair<int,pair<int,int> > > q;
bitset <nmx> viz;

void citire()
{
    scanf("%d %d", &n, &m);
    for(int i = 1; i <= m; ++i)
    {
        int nod1,nod2,cost;
        scanf("%d %d %d", &nod1, &nod2, &cost);
        g[nod1].push_back(make_pair(nod2,cost));
        g[nod2].push_back(make_pair(nod1,cost));
    }
}

void rezolvare()
{
    viz[1] = true;
    for(vector<pair<int,int> >::iterator it = g[1].begin(); it != g[1].end(); ++it)
        q.push(make_pair(-(it->second),make_pair(1,it->first)));

    int nr = 1;

    while(nr < n)
    {
        int cost = -q.top().first, tata = q.top().second.first, nod = q.top().second.second;
        q.pop();

        if(viz[nod])
            continue;

        viz[nod] = true;
        ++ nr;

        total += cost;
        muchii.push_back(make_pair(tata,nod));

        for(vector<pair<int,int> >::iterator it = g[nod].begin(); it != g[nod].end(); ++it)
            if(not viz[it->first])
                q.push(make_pair(-(it->second),make_pair(nod,it->first)));
    }

}

void afish()
{
    printf("%d\n", total);
    printf("%d\n", n - 1);
    for(vector<pair<int,int> >::iterator it = muchii.begin(); it != muchii.end(); ++it)
        printf("%d %d\n", it->first, it->second);
}

int main()
{
    freopen("apm.in", "r", stdin);
    freopen("apm.out", "w", stdout);
    citire();
    rezolvare();
    afish();
    return 0;
}