#include<bits/stdc++.h>
#define For(i,l,r) for(int i = (l),i##end = (r);i <= i##end;i++)
#define Fordown(i,r,l) for(int i = (r),i##end = (l);i >= i##end;i--)
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int N = 15;
int dp[1 << N][N + 1],Sum[1 << N],G[N + 1][N + 1];
inline int read(){
	int x = 0,flag = 1;
	char ch = getchar();
	while(!isdigit(ch) && ch != '-')ch = getchar();
	if(ch == '-')flag = -1,ch = getchar();
	while(isdigit(ch))x = (x << 3) + (x << 1) + ch - '0',ch = getchar();
	return x * flag;
}
int main(){
	int n = read(),m = read(),tot = 0;
	For(i,1,m){
		int x = read(),y = read(),z = read();
		G[x][y] = G[y][x] = z,tot += z;
	}
	For(i,1,(1 << n) - 1){
		For(j,1,n)if(i & (1 << (j - 1)))
			For(k,j + 1,n)if(i & (1 << (k - 1)))
				Sum[i] += G[j][k];
	}
	memset(dp,-63,sizeof(dp));
	dp[1][1] = 0;
	For(i,1,(1 << n) - 1)For(j,1,n){
		int res = dp[i][j];
		if(res < 0)continue;
		For(k,1,n)if(!(i & (1 << (k - 1))) && G[j][k])
			dp[i | (1 << (k - 1))][k] = max(dp[i | (1 << (k - 1))][k],res + G[j][k]);
		int S0 = (1 << n) - 1 - i;
		for(int S = S0;S;S = (S - 1) & S0)
			dp[i | S][j] = max(dp[i | S][j],res + Sum[S | (1 << (j - 1))]);
	}
	printf("%d\n",tot - dp[(1 << n) - 1][n]);
	return 0;
}