#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const long double eps = 1E-14;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

//////////////////////////////////////

int main() {
	ll N, M;
	cin >> N >> M;
	vvll c(N, vll(N, 0));
	repn(i, M) {
		ll a, b, x;
		cin >> a >> b >> x;
		c[a-1][b-1] = x;
		c[b-1][a-1] = x;
	}


	vll con(1 << N,0);

	rep(t,1<<N){
		rep(i, N)for(ll j=i+1;j<N;j++) {
			if ((t >> i) & 1 && (t >> j) & 1) { con[t] += c[i][j]; }
		}
		//cout << t <<" "<< con[t] << endl;
	}

	vvll dp(1 << N, vll(N, -1));

	rep(t, 1 << N) {
		rep(v, N) {
			if (!(t & 1)) { continue; }
			if (!((t >> v) & 1)) { continue; }

			if (v == 0) { dp[t][v] = con[t]; continue; }

			for (ll u = t; u > 0; u = (u - 1) & t) {
				if (!(u & 1)) { continue; }
				if ((u >> v) & 1) { continue; }

				rep(w, N) {
					if (((u >> w) & 1)&&c[w][v]>0&&dp[u][w]>=0) {
						ll now = dp[u][w] + c[w][v] + con[t & ~u];
						dp[t][v] = max(now, dp[t][v]);
					}
				}
			}

			//cout << t << " " << v << " " << dp[t][v] << endl;
		}
	}

	ll all = 0;
	rep(i, N)for(ll j=i+1;j<N;j++)all += c[i][j];
	cout << all - dp[(1 << N) - 1][N-1] << endl;
}

Measured memory_bytes: 8464