#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int n,m,cnt,out[15],k,ans=1e9+7,E[15][15],dp[15][15][1<<15];
//dp[x][d][s] 点x在集合s中深度为d时的最小总代价
//目标状态为cnt==(1<<n)-1
//out[i]为层数 


void work(int x,int sum,int deep)
{
	//转移方程为dp[x][deep][1<<(x-1)]=min(dp[x][deep][1<<(x-1)],sum+out[i]*E[i][j]) 
	//sum为上一层dp时的最优解,deep为层数,x为当前的集合 
	if(sum>=ans) return ;//剪 枝 
	if(x==cnt) 
	{
		ans=sum;
		return ;
	}
	for(int i=1;i<=n;i++)
	{
		if(!(1<<(i-1)&x)) continue ;
		for(int j=1;j<=n;j++)
		{
			if(!((1<<(j-1))&x)&&E[i][j]<1e9+7)
			{
				if(dp[j][deep+1][1<<(j-1)|x]<=sum+out[i]*E[i][j]) continue;
				dp[j][deep+1][1<<(j-1)|x]=sum+out[i]*E[i][j];
				out[j]=out[i]+1;
				work(1<<(j-1)|x,dp[j][deep+1][1<<(j-1)|x],deep+1);
			}
		}
	}
}

int main()
{
	scanf("%d%d",&n,&m);
	cnt=(1<<n)-1;
	memset(E,0x3f,sizeof(E));
	while(m--)
	{
		int u,v,w;
		scanf("%d%d%d",&u,&v,&w);
		E[u][v]=E[v][u]=min(E[u][v],w);
//		add(u,v,w);add(v,u,w);
//		in[u]++;in[v]++;
//		out[u]++;out[v]++;
//		if(out[u]>out[v]&&out[u]>out[maxu]) maxu=u;
//		if(out[v]>out[u]&&out[v]>out[maxu]) maxu=v;
//		maxout=max(maxout,max(out[u],out[v]));
	}
	for(int i=1;i<=n;i++)
	{
		memset(out,0,sizeof(out));
		memset(dp,0x3f,sizeof(dp));
		out[i]=1;
		//初始化 
		work(1<<(i-1),0,0); 
	}
	printf("%d\n",ans);
	return 0;
 }