#include <bits/stdc++.h>
#include <unistd.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
 
 
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { -1,0, 1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
// #define mp make_pair
//#define endl '\n'

signed main() {
  fio();
  int n, m;
  cin >> n >> m;

  ll sum = 0;
  vector<vector<pll>> G(n);
  rep (i, m) {
    int u, v, c;
    cin >> u >> v >> c;
    sum += c;
    u--; v--;
    G[u].push_back(pll(v, c));
    G[v].push_back(pll(u, c));
  }

  vl value(1 << n);
  rep (i, 1 << n) {
    rep (u, n) {
      rep (j, G[u].size()) {
        int v = G[u][j].first;
        if (u > v) continue;
        if ((i & (1 << u)) and (i & (1 << v))) {
          value[i] += G[u][j].second;
        }
      }
    }
  }

  vll dp(1 << n, vl(n, -INF));
  dp[1][0] = 0;
  int mask = (1 << n) - 1;
  rep (i, 1 << n) {
    rep (u, n) {
      if (dp[i][u] <= -INF / 2) continue;
      int nokori = mask ^ i;
      ll x = nokori;
      do {
        chmax(dp[i | x][u], dp[i][u] + value[x | (1 << u)]);
        x = (x - 1)&nokori;
      } while (x != nokori);

      rep (v, n) {
        if (i & (1 << v)) continue;
        int ni = i | (1 << v);
        if (value[(1 << u) | (1 << v)] > 0) {
          chmax(dp[ni][v], dp[i][u] + value[(1 << u) | (1 << v)]);
        }
      }
    }
  }

  //DEBUG_MAT(dp);
  
  ll ans = dp[mask][n - 1];

  cout << sum - ans << endl;
}


Measured memory_bytes: 5376