#include <bits/stdc++.h>
using namespace std;
const int inf = 1 << 30;
const int MAXN = 2e4;
const int MAXM = 2e5;
int n, m, S, T, cnt, in[MAXN], out[MAXN], cur[MAXN], d[MAXN];
vector<int> Eid[MAXN];
struct Edge {
  int c, v;
} E[MAXM];
void AddEdge(int x, int y, int c) {
  E[++cnt].v = y, E[cnt].c = c;
  Eid[x].push_back(cnt);
  E[++cnt].v = x, E[cnt].c = c;
  Eid[y].push_back(cnt);
}
bool BFS() {
  static int Q[MAXN];
  int x, i, ql, qr;
  for (i = 0; i <= n; i++) d[i] = -1;
  Q[ql = qr = 0] = S;
  d[S] = 0;
  while (ql <= qr) {
    x = Q[ql++];
    for (i = 0; i < Eid[x].size(); i++) {
      const Edge &e = E[Eid[x][i]];
      if (e.c && d[e.v] == -1) {
        Q[++qr] = e.v;
        d[e.v] = d[x] + 1;
        if (e.v == T) return 1;
      }
    }
  }
  return 0;
}
int Aug(int x, int a) {
  if (x == T) return a;
  int aug = 0, delta;
  for (int &i = cur[x]; i < Eid[x].size(); i++) {
    Edge &e = E[Eid[x][i]];
    if (e.c && d[e.v] == d[x] + 1) {
      delta = Aug(e.v, min(a, e.c));
      if (delta) {
        e.c -= delta;
        E[Eid[x][i] ^ 1].c += delta;
        aug += delta;
        if (!(a -= delta)) break;
      }
    }
  }
  if (!aug) d[x] = -1;
  return aug;
}
int MaxFlow() {
  int flow = 0;
  while (BFS()) {
    for (int i = 0; i <= n; i++) cur[i] = 0;
    flow += Aug(S, inf);
  }
  return flow;
}
int ans, a[MAXN], b[MAXN], c[MAXN], mark[MAXN], f[MAXN];
tuple<int, int, int> e[MAXN];
vector<int> v[MAXN];
void solve(int l, int r) {
  if (l == r) return;
  random_shuffle(a + l, a + r + 1);
  for (int i = 0; i <= cnt; i += 2)
    E[i].c = E[i ^ 1].c = E[i].c + E[i ^ 1].c >> 1;
  S = a[l];
  T = a[r];
  e[++m] = make_tuple(MaxFlow(), S, T);
  ans += get<0>(e[m]);
  int t = 0, t1 = 0;
  for (int i = l; i <= r; i++)
    if (d[a[i]] == -1)
      c[++t1] = a[i];
    else
      b[++t] = a[i];
  for (int i = 1; i <= t; i++) a[l + i - 1] = b[i];
  for (int i = 1; i <= t1; i++) a[r - i + 1] = c[i];
  solve(l, r - t1);
  solve(r - t1 + 1, r);
}
int find(int x) {
  if (x != f[x]) return f[x] = find(f[x]);
  return x;
}
int main() {
  cnt = -1;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; i++) {
    int x, y, z;
    scanf("%d%d%d", &x, &y, &z);
    AddEdge(x, y, z);
  }
  for (int i = 1; i <= n; i++) a[i] = i;
  m = 0;
  solve(1, n);
  sort(e + 1, e + 1 + m);
  for (int i = 1; i <= n; i++) f[i] = i, v[i].push_back(i);
  for (int i = m; i >= 1; i--) {
    int a, b;
    a = get<1>(e[i]);
    b = get<2>(e[i]);
    a = find(a);
    b = find(b);
    f[b] = a;
    for (int j = 0; j < v[b].size(); j++) v[a].push_back(v[b][j]);
  }
  cout << ans << endl;
  for (int i = 0; i < n; i++) cout << v[find(1)][i] << " ";
}
