/**
 *    author:  tourist
 *    created: 17.11.2019 02:16:43       
**/
#include <bits/stdc++.h>

using namespace std;

template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vector<vector<int>> a(n, vector<int>(n, 0));
  long long total = 0;
  for (int i = 0; i < m; i++) {
    int x, y, z;
    cin >> x >> y >> z;
    --x; --y;
    a[x][y] = a[y][x] = z;
    total += z;
  }
  const int inf = (int) 1e9;
  vector<int> inside(1 << n);
  for (int t = 0; t < (1 << n); t++) {
      for (int i = 0; i < n; i++) {
        if (t & (1 << i)) {
          for (int j = i + 1; j < n; j++) {
            if (t & (1 << j)) {
              inside[t] += a[i][j];
            }
          }
        }
      }
  }
  debug(inside);
  vector<vector<int>> dp(1 << n, vector<int>(n, -1));
  for (int t = 0; t < (1 << n); t++) if (t & 1) dp[t][0] = inside[t];
  for (int t = 0; t < (1 << n); t++) {
    for (int ii = 0; ii < n; ii++) {
    if (dp[t][ii] == -1) continue;
    int u = (1 << n) - 1 - t;
    while (u > 0) {
      for (int j = 0; j < n; j++) {
        if (u & (1 << j)) {
          if (a[ii][j] > 0) {
            dp[t | u][j] = max(dp[t | u][j], dp[t][ii] + inside[u] + a[ii][j]);
          }
        }
      }
      u = (u - 1) & ((1 << n) - 1 - t);
    }
    }
  }
  debug(total);
  debug(dp);
  cout << total - dp[(1 << n) - 1][n - 1] << '\n';
  return 0;
}


Measured memory_bytes: 3712