#include <cstdio>
#include <vector>
#include <algorithm>

const int MAXM = 4e5;

struct Edge {
  int x, y, cost;
  bool operator <(const Edge &aux) const {
    return cost < aux.cost;
  }
};

int h[MAXM + 1], p[MAXM + 1];
Edge v[MAXM + 1];
std::vector <int> ans;

inline void init(int n) {
  for (int i = 0; i < n; ++i) {
    h[i] = 1;
    p[i] = i;
  }
}

inline int find(int x) {
  int r = x;
  while (p[r] != r) {
    r = p[r];
  }
  while (p[x] != r) {
    int tmp = p[x];
    p[x] = r;
    x = tmp;
  }
  return r;
}

inline void _union(int x, int y) {
  int rx = find(x), ry = find(y);
  if (rx != ry) {
    if (h[rx] > h[ry]) {
      p[ry] = rx;
    } else if (h[ry] > h[rx]) {
      p[rx] = ry;
    } else {
      p[rx] = ry;
      ++h[ry];
    }
  }
}

int main() {
  int n, m, x, y, cost;
  FILE *f = fopen("apm.in", "r");
  fscanf(f, "%d%d", &n, &m);
  for (int i = 1; i <= m; ++i) {
    fscanf(f, "%d%d%d", &v[i].x, &v[i].y, &v[i].cost);
  }
  fclose(f);
  init(n);
  std::sort(v + 1, v + m + 1);
  cost = 0;
  for (int i = 1; i <= m; ++i) {
    x = find(v[i].x);
    y = find(v[i].y);
    if (x != y) {
      _union(x, y);
      cost += v[i].cost;
      ans.push_back(i);
    }
  }
  f = fopen("apm.out", "w");
  fprintf(f, "%d\n%d\n", cost, ans.size());
  for (auto i: ans) {
    fprintf(f, "%d %d\n", v[i].x, v[i].y);
  }
  fclose(f);
  return 0;
}