#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int MOD2 = 1007681537;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline long long isqrt(long long k) {
  long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
const int maxn = 15 + 1;
const int p3_15 = 14348907;
int p3[maxn];
int f[p3_15][maxn];
int gg[1 << maxn];
int n, m;
int g[maxn][maxn];
int cost[1 << maxn][maxn];
int ff[p3_15];
int dp[1 << maxn][maxn];
void solve() {
  p3[0] = 1;
  for (int i = (1); i < (maxn); i++) p3[i] = p3[i - 1] * 3;
  for (int msk = (0); msk < (p3_15); msk++) {
    int t = msk;
    for (int i = (0); i < (15); i++) {
      f[msk][i] = t % 3;
      t /= 3;
    }
  }
  for (int msk = (0); msk < (1 << maxn); msk++) {
    for (int i = (15) - 1; i >= (0); i--) {
      gg[msk] *= 3;
      if ((((msk) >> (i)) & 1)) {
        gg[msk]++;
      }
    }
  }
  cin >> n >> m;
  for (int i = (0); i < (m); i++) {
    int u, v, w;
    cin >> u >> v >> w;
    u--, v--;
    g[u][v] = g[v][u] = w;
  }
  for (int msk = (0); msk < (1 << n); msk++)
    for (int i = (0); i < (n); i++)
      if (!(((msk) >> (i)) & 1)) {
        for (int j = (0); j < (n); j++)
          if ((((msk) >> (j)) & 1)) {
            cost[msk][i] += g[i][j];
          }
      }
  for (int msk = (0); msk < (p3[n]); msk++) {
    int p1 = 0, p2 = 0;
    for (int i = (n)-1; i >= (0); i--) {
      p1 <<= 1, p2 <<= 1;
      if (!f[msk][i]) {
        p1 |= 1;
      } else if (f[msk][i] == 2) {
        p2 |= 1;
      }
    }
    for (int i = (0); i < (n); i++)
      if (!f[msk][i]) {
        ff[msk] += cost[p2][i];
      }
  }
  for (int msk = (0); msk < (1 << n); msk++)
    for (int i = (0); i < (n); i++) dp[msk][i] = INF;
  for (int msk = (0); msk < (1 << n); msk++)
    if ((((msk) >> (0)) & 1)) dp[msk][0] = 0;
  for (int msk = (0); msk < (1 << n); msk++)
    for (int i = (0); i < (n); i++)
      if ((((msk) >> (i)) & 1)) {
        for (int j = (0); j < (n); j++)
          if (!(((msk) >> (j)) & 1) && g[i][j]) {
            chkmin(dp[msk | (1 << j)][j], dp[msk][i] + cost[msk][j] - g[i][j]);
          }
        int pmsk = msk ^ (1 << n) - 1;
        for (int submsk = pmsk; submsk; submsk = submsk - 1 & pmsk) {
          int hs = gg[pmsk | (1 << i)] + gg[submsk];
          chkmin(dp[msk | submsk][i], dp[msk][i] + ff[hs]);
        }
      }
  cout << dp[(1 << n) - 1][n - 1] << "\n";
}
int main() {
  int JUDGE_ONLINE = 1;
  if (fopen("in.txt", "r")) {
    JUDGE_ONLINE = 0;
    assert(freopen("in.txt", "r", stdin));
  } else {
    ios_base::sync_with_stdio(0), cin.tie(0);
  }
  solve();
  if (!JUDGE_ONLINE) {
  }
  return 0;
}
