#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define LL long long
#define INF 0x3f3f3f3f
#define Inf 1000000000000000000LL
#define F first
#define S second
using namespace std;
typedef pair<int,int>pii;
int n,m;
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>n>>m;
	vector<vector<int> >a(n,vector<int>(n,0));
	LL total=0;
	for(int i=0;i<m;i++){
		int x,y,z;
		cin>>x>>y>>z;
		x--,y--;
		a[x][y]=a[y][x]=z;
		total+=z;
	}
	const int inf=(int)1e9;
	vector<int>inside(1<<n);
	for(int t=0;t<(1<<n);t++)
		for(int i=0;i<n;i++)if(t&(1<<i))
			for(int j=i+1;j<n;j++)if(t&(1<<j))
				inside[t]+=a[i][j];
	vector<vector<int> >dp(1<<n,vector<int>(n,-1));
	for(int t=0;t<(1<<n);t++)if(t&1)dp[t][0]=inside[t];
	for(int t=0;t<(1<<n);t++)
		for(int ii=0;ii<n;ii++){
			if(dp[t][ii]==-1)continue;
			int u=(1<<n)-1-t;
			while(u>0){
				for(int j=0;j<n;j++)
					if(u&(1<<j))if(a[ii][j]>0)
							dp[t|u][j]=max(dp[t|u][j],dp[t][ii]+inside[u]+a[ii][j]);
				u=(u-1)&((1<<n)-1-t);
			}
		}
	cout<<total-dp[(1<<n)-1][n-1]<<endl;
	return 0;
}
