#include <bits/stdc++.h>
using namespace std;
int I[40000],n,m,H[20],a[20][20],x,y,ans,f[20][35000],w[35000];
int main(){
	scanf("%d%d",&n,&m);
	I[1]=H[1]=1; for (int i=2;i<=n+1;++i) H[i]=H[i-1]<<1,I[H[i]]=i;
	for (int i=1;i<=m;++i){
		scanf("%d%d",&x,&y);
		scanf("%d",&a[x][y]);
		a[y][x]=a[x][y];
		for (int j=1;j<H[n+1];++j)
		if (j&H[x]&&j&H[y]) w[j]+=a[x][y];
	}
	for (int i=1;i<=n;++i)
	for (int j=0;j<H[n+1];++j) f[i][j]=-1;
	for (int s=1;s<H[n];s+=2) f[1][s]=w[s];
	for (int s=1;s<H[n];s+=2){
		for (int i=2;i<n;++i)
		if (H[i]&s){
			int S=s^H[i];
			for (int o=S;o;o=o-1&S)
			if (o&1){
				for (int j=o;j;j-=j&-j)
				if (a[i][I[j&-j]])
					f[i][s]=max(f[i][s],a[i][I[j&-j]]+f[I[j&-j]][o]+w[s-o]);
			}
		}
	}
	for (int i=1;i<n;++i)
	if (a[i][n])
	for (int s=1;s<H[n];s+=2)
	if (f[i][s]>-1)
	ans=max(ans,f[i][s]+a[i][n]+w[H[n+1]-1-s]);
	printf("%d\n",w[H[n+1]-1]-ans);
	return 0;
}