#include<bits/stdc++.h>
using namespace std;
int e[20][20];
int v[33333];
int f[33333][20];
int n,m,ans;
int main(){
	scanf("%d%d",&n,&m);
	for (int i=1;i<=m;i++){
		int x,y,v;
		scanf("%d%d%d",&x,&y,&v);
		e[--x][--y]=v; e[y][x]=v;
		ans+=v;
	}
	for (int i=0;i<1<<n;i++)
		for (int j=0;j<n;j++)
			if (i&(1<<j))
				for (int k=j+1;k<n;k++)
					if (i&(1<<k))
						v[i]+=e[j][k];
	memset(f,233,sizeof(f));
	for (int i=0;i<1<<n;i++)
		if (i&1) f[i][0]=v[i];
	for (int i=0;i<1<<n;i++)
		for (int j=0;j<n;j++)
			if (f[i][j]>=0){
				//printf("%d %d %d\n",i,j,f[i][j]);
				int res=(1<<n)-1-i;
				for (int ano=res;ano;ano=(ano-1)&res)
					for (int k=0;k<n;k++)
						if (e[j][k]&&!(i&(1<<k))&&(ano&(1<<k)))
							f[i|ano][k]=max(f[i|ano][k],f[i][j]+v[ano]+e[j][k]);
			}
	printf("%d\n",ans-f[(1<<n)-1][n-1]);
}