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

#define mp make_pair

using namespace std;

const int NMax = 200005;
const int inf = 0x3f3f3f3f;
bitset < NMax > viz;
vector < pair < int, int > > G[NMax];
priority_queue < pair < int, int > > Q;
int N, M;
int dist[NMax], dad[NMax];

void Read()
{
    scanf("%d %d", &N, &M);
    for(int i=1; i<=M; ++i)
    {
        int x, y, c;
        scanf("%d %d %d", &x, &y, &c);
        G[x].push_back(mp(c,y));
        G[y].push_back(mp(c,x));
    }
}

void Solve()
{
    memset(dist,inf,sizeof(dist));
    Q.push(mp(0,1));

    while(!Q.empty())
    {
        int nodc=Q.top().second;
        Q.pop();

        if(viz[nodc])
            continue;

        viz[nodc] = 1;
        vector < pair < int, int > >::iterator it;
        for(it=G[nodc].begin(); it!=G[nodc].end(); ++it)
        {
            if(!viz[it->second] && dist[it->second] > it->first)
            {
                dist[it->second] = it->first;
                Q.push(mp(-dist[it->second],it->second));
                dad[it->second] = nodc;
            }
        }
    }

    int S = 0;
    for(int i=2; i<=N; ++i)
        S += dist[i];

    printf("%d\n%d\n", S, N-1);
    for(int i=2; i<=N; ++i)
        printf("%d %d\n", i, dad[i]);
}

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