#include <bits/stdc++.h>

using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");
int n, m, cost;
int parent[200001], rang[200001];

struct edge{
  int x, y, cost;
};
vector<edge> edges;
vector<pair<int, int>> result;

bool comparer(edge e1, edge e2)
{
  return e1.cost < e2.cost;
}

void read()
{
  f>>n>>m;
  int x, y, z;
  
  for(int i = 1;i <= m;++i)
    f>>x>>y>>z, edges.push_back({x, y, z});
}

int find(int x)
{
  if(parent[x] == x)
    return x;
  return parent[x] = find(parent[x]);
}

void unite(int x, int y)
{
  if(rang[x] > rang[y])
    parent[y] = x, rang[x] += rang[y];
  else
    parent[x] = y, rang[y] += rang[x];
}

void solve()
{
  for(int i = 1;i <= n;++i)
    rang[i] = 1, parent[i] = i;
  sort(edges.begin(), edges.end(), comparer);

  
  for(auto it : edges)
    if(find(it.x) != find(it.y))
    {
      cost += it.cost;
      unite(find(it.x), find(it.y));
      result.push_back(make_pair(it.x, it.y));
    }
  
  g<<cost<<'\n'<<result.size()<<'\n';
  for(auto it : result)
    g<<it.first<<" "<<it.second<<'\n';
}

int main()
{
  read();
  solve();
  return 0;
}