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

#define Nmax 200005
#define INF 0x3f3f3f3f

using namespace std;
vector<pair<int,int> > G[Nmax];
priority_queue<pair<int,int> > Q;
bitset<Nmax> used;
int DP[Nmax],daddy[Nmax],N,M;

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

void Prim( void ){
    memset(DP,INF,sizeof(DP));
    DP[1] = 0;
    Q.push(make_pair(0,1));
    int k;
    while(!Q.empty()){
        k = Q.top().second;
        used[k] = 1;Q.pop();
        for(vector<pair<int,int> >::iterator it = G[k].begin(); it != G[k].end(); ++it)
            if(!used[it->second] && DP[it->second] > it->first){
                DP[it->second] = it->first;
                daddy[it->second] = k;
                Q.push(make_pair(-it->first,it->second));
            }
    }
}

void Print( void ){
    int sol = 0;
    for(int i = 1; i <= N; ++i)
        sol += DP[i];
    printf("%d\n%d\n",sol,N-1);
    for(int i = 2; i <= N; ++i)
        printf("%d %d\n",i,daddy[i]);
}

int main()
{
    freopen("apm.in","r",stdin);
    freopen("apm.out","w",stdout);

    Read();
    Prim();
    Print();

    return 0;
}