#include <bits/stdc++.h>
#define pb push_back

using namespace std;
int n,m,ans=0;
int d[200005],pred[200005];
priority_queue<pair<int,int>> q;
bool inq[200005];
vector<pair<int,int>> v[200005],arbore;
const int inf=1<<30;

void prim()
{
    for(int i=1;i<=n;i++)
        d[i]=inf;
    d[1]=0,ans=0;
    q.push({0,1});
    while(!q.empty())
    {
        int x=q.top().second;
        q.pop();
        if(inq[x])
           continue;
        ans+=d[x];
        inq[x]=true;
        if(pred[x])
           arbore.pb({x,pred[x]});
        for(auto p:v[x])
        {
            int y=p.first;
            int c=p.second;
            if(c<d[y] && !inq[y])
               d[y]=c,pred[y]=x,q.push({-c,y});
        }
    }
}

int main()
{
    ifstream cin("apm.in");
    ofstream cout("apm.out");
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,c;
        cin>>x>>y>>c;
        v[x].pb({y,c});
        v[y].pb({x,c});
    }
    prim();
    cout<<ans<<"\n"<<arbore.size()<<"\n";
    for(auto edge:arbore)
        cout<<edge.first<<" "<<edge.second<<"\n";
    return 0;
}