#include <iostream>
#include <queue>
#include <fstream>
#include <vector>
#include <algorithm>
#define inf 0x3f3f3f3f

using namespace std;

ifstream fin("apm.in");
ofstream fout("apm.out");

vector <pair<int,int> >g[200005];
priority_queue <pair<int,int> >q;
int n,m,used[200005],d[200005],t[200005];

void citire()
{
    int x,y,c;
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        g[x].push_back(make_pair(c,y));
        g[y].push_back(make_pair(c,x));
    }
    for(int i=1;i<=n;i++)
        d[i]=inf;
};

int select()
{
    int pzmin,mn=inf;
    for(int i=1;i<=n;i++)
    {
        if(d[i]<mn&&!used[i])
        {
            mn=d[i];
            pzmin=i;
        }
    }
    return pzmin;
}

void rezolv()
{
    int k;
    d[1]=0;
    q.push(make_pair(-d[1],1));
    while(!q.empty())
    {
        k=q.top().second;
        q.pop();
        used[k]=1;
        vector<pair<int,int> >::iterator ii;
        for(ii=g[k].begin();ii!=g[k].end();++ii)
            if(d[ii->second]>ii->first&&!used[ii->second])
            {
                d[ii->second]=ii->first;
                t[ii->second]=k;
                q.push(make_pair(-d[ii->second],ii->second));
            }
    }
}

void afisare()
{
    int c=0;
    for(int i=2;i<=n;i++)
        c+=d[i];
    fout<<c<<"\n"<<n-1<<"\n";
    for(int i=2;i<=n;i++)
        fout<<i<<" "<<t[i]<<"\n";
}

int main()
{
    citire();
    rezolv();
    afisare();
    return 0;
}