#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int INF = 1 << 30;
int mat[15][15];
int cost[1 << 15][15];
int dp[1 << 15][15];
int main() {
	int N, M;
	cin >> N >> M;
	for (int i = 0; i < M; i++) {
		int a, b, c;
		cin >> a >> b >> c;
		a--; b--;
		mat[a][b] = mat[b][a] = c;
	}
	for (int mask = 0; mask < (1 << N); mask++) {
		for (int i = 0; i < N; i++) {
			dp[mask][i] = INF;
			for (int j = 0; j < N; j++) {
				if (mask&(1 << j)) cost[mask][i] += mat[i][j];
			}
		}
	}
	dp[1][0] = 0;
	for (int mask = 0; mask < (1 << N); mask++) {
		for (int i = 0; i < N; i++) {
			if (mask&(1 << i) == 0 || dp[mask][i] == INF) continue;
			for (int j = 0; j < N; j++) {
				if (mask&(1 << j) || mat[i][j] == 0) continue;
				int add = cost[mask][j] - mat[i][j];
				dp[mask | (1 << j)][j] = min(dp[mask | (1 << j)][j], dp[mask][i] + add);
			}
			int nmask = mask ^ (1 << i);
			int comp = ((1 << N) - 1) ^ mask;
			for (int bit = comp; bit > 0; bit = (bit - 1)&comp) {
				int add = 0;
				for (int j = 0; j < N; j++) {
					if (bit&(1 << j)) add += cost[nmask][j];
				}
				dp[mask | bit][i] = min(dp[mask | bit][i], dp[mask][i] + add);
			}
		}
	}
	cout << dp[(1 << N) - 1][N - 1] << endl;
}
