#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("apm.in");
ofstream cout("apm.out");
struct muchie
{
    int x;
    int y;
    int c;
    friend bool operator<(muchie a,muchie b)
    {
        return a.c>b.c;
    }
};

int n,m,x,y,c,suma;
vector<pair<int,int>> ans;
priority_queue<muchie> q;
vector<pair<int,int>> g[200001];
bool use[200001];
int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        cin>>x>>y>>c;
        g[x].push_back({y,c});
        g[y].push_back({x,c});
    }
    use[1]=1;
    for(auto i:g[1])
    {
        q.push({1,i.first,i.second});
    }
    while(ans.size()<n-1)
    {
        muchie a=q.top();
        q.pop();
        if(use[a.x] && use[a.y])
            continue;
        ans.push_back({a.x,a.y});
        use[a.y]=1;
        suma+=a.c;
        int b=-1;
        if(use[a.x]==0)
            b=a.x;
        else b=a.y;
        for(auto i:g[b])
        {
            q.push({b,i.first,i.second});
        }
        
    }
    cout<<suma<<'\n'<<ans.size()<<'\n';
    for(auto i:ans)
        cout<<i.first<<' '<<i.second<<'\n';
    return 0;
}