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

#define Nmax 200005
#define INF 0x3f3f3f3f

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

void Read()
{
    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));
    }
    memset(DP,INF,sizeof(DP));
}
void Prim(int k) /// Nlog2N
{
    DP[k] = 0;
    Q.push(make_pair(0,k));
    while(!Q.empty())
    {
        k = Q.top().second;
        Q.pop(); used[k] = 1;
        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(-DP[it->second],it->second));
            }
    }
}


void Print()
{
    int cst = 0;
    for(int i = 1; i <= N; ++i)
        cst += DP[i];
    printf("%d\n%d\n",cst,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(1);
    Print();

    return 0;
}