#include <fstream>
#include <vector>
#include <set>

#define Nmax 200001
#define inf 20000001
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
vector<pair<int,int> >graph[Nmax];
int n,m;
void Read()
{
    int i,x,y,cost;
    fin>>n>>m;
    for(i=1;i<=m;++i)
    {
        fin>>x>>y>>cost;
        graph[x].push_back(make_pair(y,cost));
        graph[y].push_back(make_pair(x,cost));
    }
}
void Prim(int s)
{
    int i,x,cost;
    set< pair<int,int> >S;
    set< pair<int,int> >::iterator it;
    vector<int>d(n+1);
    vector<int>viz(n+1);
    vector<int>t(n+1);
    for(i=1;i<=n;++i)
       if(i!=s)
          d[i]=inf;
    for(i=1;i<=n;++i)
        S.insert(make_pair(d[i],i));
    for(i=1;i<=n-1;++i)
    {
        it=S.begin();
        x=it->second;
        viz[x]=1;
        cost=it->first;
        S.erase(it);
        for(auto nod:graph[x])
            if(viz[nod.first]==0&&nod.second<d[nod.first])
        {
            S.erase(make_pair(d[nod.first],nod.first));
            d[nod.first]=nod.second;
            S.insert(make_pair(d[nod.first],nod.first));
            t[nod.first]=x;
        }
    }
    cost=0;
    for(i=1;i<=n;++i)cost+=d[i];
    fout<<cost<<"\n"<<n-1<<"\n";
    for(i=1;i<=n;++i)if(i!=s)fout<<i<<" "<<t[i]<<"\n";
}
int main()
{
    Read();
    Prim(1);
    return 0;
}