#include <bits/stdc++.h>
#define cin fin
#define cout fout
using namespace std;
ifstream cin ("apm.in");
ofstream cout ("apm.out");
vector<pair<int,int>>G[108];
struct nodd
{
    int nod,val,tata;
};
struct compar
{
    bool operator () (nodd a, nodd b)
    {
        return a.val>b.val;
    }
};
int t[108],s,cnt,n,m,i,viz[108],a,b,c;
priority_queue<int,vector<nodd>,compar>Q;
void Prim (int nodstart)
{
    Q.push({nodstart,0,0});
    while(cnt<n)
    {
        nodd k=Q.top();
        Q.pop();
        if(viz[k.nod]==0)
        {
            viz[k.nod]=1;
            t[k.nod]=k.tata;
            s=s+k.val;
            cnt++;
            for(auto i:G[k.nod])
            {
                if(viz[i.first]==0)
                {
                    Q.push({i.first,i.second,k.nod});
                }
            }
        }
    }
}
int main()
{
    cin>>n>>m;
    for(i=1; i<=m; i++)
    {
        cin>>a>>b>>c;
        G[a].push_back(make_pair(b,c));
        G[b].push_back(make_pair(a,c));
    }
    Prim(1);
    cout<<s<<'\n';
    cout<<n-1<<'\n';
    for(i=1; i<=n; i++)
    {
        cout<<i<<" "<<t[i]<<'\n';
    }
    return 0;
}