#include <bits/stdc++.h>

using namespace std;

typedef long long LL;
#define repp(i,a,b) for(int i = (int)(a) ; i < (int)(b) ; ++i)
#define repm(i,a,b) for(int i = (int)(a) ; i > (int)(b) ; --i)

int main(){
	int N,M; cin >> N >> M;
	int s = 0;
	vector<vector<int>> c(N,vector<int>(N,0));
	repp(i,0,M){
		int x,y,z; cin >> x >> y >> z;
		--x; --y;
		c[x][y] = c[y][x] = z;
		s += z;
	}
	vector<int> d(1<<N,0);
	repp(k,1,1<<N){
		int i = 0;
		while(!(k&(1<<i))) ++i;
		d[k] = d[k^(1<<i)];
		repp(j,i+1,N) if(k&(1<<j)) d[k] += c[i][j];
	}
	vector<vector<int>> dp(1<<N,vector<int>(N,-123456789));
	dp[1][0] = 0;
	repp(k,0,1<<(N-1)) repp(i,0,N-1) if((k*2+1)&(1<<i)) repp(j,1,N) if(!((k*2+1)&(1<<j))) if(c[i][j] > 0) dp[(k*2+1)^(1<<j)][j] = max(dp[(k*2+1)^(1<<j)][j],dp[k*2+1][i]+c[i][j]);
	repp(k,0,1<<(N-1)){
		for(int m = k ; m > 0 ; m = (m-1)&k){
			dp[2*k+1][N-1] = max(dp[2*k+1][N-1],dp[2*(k^m)+1][N-1]+d[m*2+1]);
			repp(i,0,N-1) if((m^k)&(1<<i)) dp[2*k+1][N-1] = max(dp[2*k+1][N-1],dp[2*(k^m)+1][N-1]+d[m*2+(1<<(i+1))]);
		}
	}
	cout << s-dp[(1<<N)-1][N-1] << endl;
	return 0;
}
