#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int n,m,go[20][20],dp[N][20],bit[N],q1[20],q2[20];
int main()
{
	scanf("%d%d",&n,&m);
	for (int i=0;i<n;i++) bit[1<<i]=i;
	for (int i=1;i<=m;i++){
		int u,v,l;
		scanf("%d%d%d",&u,&v,&l);u--;v--;
		go[u][v]=go[v][u]=l;
	}
	int to=1<<(n-1);
	for (int S=0;S<to;S++){
		for (int i=0;i<n;i++) dp[S][i]=1e9;
		for (int T=(S-1)&S;T<S;T=(T-1)&S){
			int s1=0,s2=0,v=0;
			for (int now=S^T;now;now-=now&-now) q2[++s2]=bit[now&-now];//可能的起点
			for (int now=T|to;now;now-=now&-now) q1[++s1]=bit[now&-now];//可能的终点
			for (int i=1;i<=s1;i++) for (int j=1;j<=s2;j++) v+=go[q1[i]][q2[j]];
			for (int i=1;i<=s1;i++) for (int j=1;j<=s2;j++) if (go[q1[i]][q2[j]])
				dp[S][q2[j]]=min(dp[S][q2[j]],dp[T][q1[i]]+v-go[q1[i]][q2[j]]);
		}
		dp[S][n-1]=0;
	}
	printf("%d\n",dp[to-1][0]);
	return 0;
}