#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <memory.h>
#include <queue>

using namespace std;
typedef long long LL;
const int maxn = 20;

int e[maxn][maxn],n,m,bin[1<<15];
LL dp[1<<15][maxn];
LL cs[1<<15][maxn]; 
LL cst[1<<15],sum;
void upd(LL &x,LL y) {if (x<y) x=y;}
int main()
{
	#ifdef LOCAL_JUDGE
		freopen("mine.in","r",stdin);
		freopen("mine.out","w",stdout);
	#endif
	scanf("%d %d",&n,&m);
	for (int i=0;i<n;i++) bin[1<<i]=i;
	for (int u,v,w,i=1;i<=m;i++)
		scanf("%d %d %d",&u,&v,&w),
		u--,v--,e[u][v]=e[v][u]=w,sum+=w;
	for (int i=0;i<n;i++)
	for (int j=1;j<(1<<n);j++)
		cs[j][i]=cs[j^(j&-j)][i]+e[bin[j&-j]][i];
	for (int i=1;i<(1<<n);i++)
		cst[i]=cst[i^(i&-i)]+cs[i^(i&-i)][bin[i&-i]];
	memset(dp,-1,sizeof dp);
	dp[1][0]=0;
	for (int s=0;s<(1<<n);s++)
	for (int u=0;u<n;u++)
	if ((s>>u&1)&&dp[s][u]!=-1) {
		for (int t=0;t<n;t++)
		if (!(s>>t&1)&&e[u][t])
			upd(dp[s^(1<<t)][t],e[u][t]+dp[s][u]);
		int o=((1<<n)-1)^s;
		for (int t=o;t;t=t-1&o)
			upd(dp[s^t][u],dp[s][u]+cst[t]+cs[t][u]);
	}
	printf("%lld",sum-dp[(1<<n)-1][n-1]);
	return 0;
}