#include <bits/stdc++.h>
using namespace std;
const int N = 16, inf = 2e9;
int n, m;
int f[N][1 << N], g[N][1 << N], a[1 << N];
int G[N][N], ans;
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= m; i++) {
    int x, y, t;
    scanf("%d %d %d", &x, &y, &t);
    G[x][y] = G[y][x] = t;
    ans += t;
  }
  for (int s = 0; s < (1 << n); s++)
    for (int i = 1; i <= n; i++)
      if (s & (1 << i - 1))
        for (int j = i + 1; j <= n; j++)
          if (s & (1 << j - 1)) a[s] += G[i][j];
  for (int s = 0; s < (1 << n); s++)
    for (int i = 1; i <= n; i++) g[i][s] = -inf;
  for (int s = 1; s < (1 << n); s++)
    if (s & 1) f[1][s] = a[s];
  for (int s = 1; s < (1 << n); s++) {
    if (!(s & 1)) continue;
    for (int i = 2; i <= n; i++)
      if (s & (1 << i - 1))
        for (int t = s; t; t = (t - 1) & s)
          if ((t & (1 << i - 1)) && !(t & 1))
            f[i][s] = max(f[i][s], g[i][s ^ t] + a[t]);
    for (int i = 1; i <= n; i++)
      if (!(s & (1 << i - 1)))
        for (int j = 1; j <= n; j++)
          if (s & (1 << j - 1))
            if (G[i][j]) g[i][s] = max(g[i][s], f[j][s] + G[i][j]);
  }
  printf("%d", ans - f[n][(1 << n) - 1]);
  return 0;
}
