/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author
 */

#ifndef MAJK_LIB
#define MAJK_LIB

#include <vector>
#include <stack>
#include <iostream>
#include <unordered_map>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <fstream>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <string>
#include <sstream>
#include <queue>
#include <bitset>
using namespace std;

#define x first
#define y second
constexpr int MOD = 1000000007;

typedef std::pair<int,int> pii;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;


template<typename T, typename F> T foo(T t, T g, F f) {
	return t;
}


template <typename T, typename U> std::istream&operator>>(std::istream&i, pair<T,U>&p) {i >> p.x >> p.y; return i;}
template<typename T>std::istream&operator>>(std::istream&i,vector<T>&t) {for(auto&v:t){i>>v;}return i;}
template<typename T>std::ostream&operator<<(std::ostream&o,const vector<T>&t) {for(size_t i=0;i<t.size();++i){o<<t[i]<<" \n"[i == t.size()-1];}return o;}
template<typename T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using maxheap = priority_queue<T, vector<T>, less<T>>;
auto fraclt = [](const pii&a,const pii&b) { return (ll)a.x * b.y < (ll)b.x * a.y; };
struct cmpfrac { bool operator()(const pii&a,const pii&b)const { return (ll)a.x * b.y < (ll)b.x * a.y; }};
template <typename T> bool in(T a, T b, T c) { return a <= b && b < c; }
int logceil(ll x) {int b=0;while(x){x>>=1;++b;}return b;}

namespace std {
    template<typename T,typename U>struct hash<pair<T,U>>{hash<T>t;hash<U>u;size_t operator()(const pair<T,U>&p)const{return t(p.x)^(u(p.y)<<7);}};
}
template<typename T,typename F>T bsh(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){l=m+1;r=m;}else{h=m-1;}}return r;}
template<typename T,typename F>T bsl(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){h=m-1;r=m;}else{l=m+1;}}return r;}
template<typename T> T gcd(T a,T b) { if (a<b) swap(a,b); return b?gcd(b,a%b):a; }

template<typename T>class vector2:public vector<vector<T>>{public:vector2(){} vector2(size_t a,size_t b,T t=T()):vector<vector<T>>(a,vector<T>(b,t)){}};
template<typename T>class vector3:public vector<vector<vector<T>>>{public:vector3(){} vector3(size_t a,size_t b,size_t c,T t=T()):vector<vector<vector<T>>>(a,vector<vector<T>>(b,vector<T>(c,t))){}};
template <typename T> struct bounded_priority_queue {
	inline bounded_priority_queue(ui X) : A(X), B(0) {}
	inline void push(ui L, T V) { B = max(B, L); A[L].push(V); }
	inline const T &top() const { return A[B].front(); }
	inline void pop() { A[B].pop(); while (B > 0 && A[B].empty()) --B; }
	inline bool empty() const { return A[B].empty(); }
	inline void clear() { B = 0; for (auto &a: A) a = queue<T>(); }
private:
	vector<queue<T>> A; ui B;
};


#endif
// #include "../l/mod.h"

class F {
public:
	int N, M;
	vector<vector<pii>> E;
	vector<vector<int>> BITS;
	vector<vector<int>> PREC;
	vector<vector<bool>> R;

	void gensuc(int i, int q, int m, int r, vector<int> &R) {
		if (i == q) { R.push_back(m^r); return; }

		gensuc(i+1, q, m, r, R);
		if (!(m & (1<<i))) {
			gensuc(i+1, q, m | (1<<i), r, R);
		}
	}

	int count(int u, int mask) {
		int ans = 0;
		for (pii e: E[u]) {
			if ((1<<e.x) & mask) ans += e.y;
		}
		return ans;
	}

	int countprev(int prevMask, int curMask, int prevN, int curN) {
		int ans = 0;
		for (int i : BITS[curMask]) {
			if (i == curN) continue;
			ans += PREC[i][((1<<N)-1) ^ prevMask ^ curMask];
		}
		if (prevN != -1) {
			ans += PREC[prevN][((1<<N)-1) ^ prevMask ^ (1<<curN)];
		}

		return ans;
	}

	void solve(istream& cin, ostream& cout) {
		cin >> N >> M;
		E.clear(); E.resize(N);
		R = vector2<bool>(N,N,false);
		for (int i = 0; i < M; ++i) {
			int a,b,c; cin >> a >> b >> c; --a; --b;
			E[a].push_back({b,c});
			E[b].push_back({a,c});
			R[a][b] = true;
			R[b][a] = true;
		}

		int X = (1 << (N-2));

		BITS.clear();
		BITS.resize(X<<2);
		for (int i = 0; i < (X<<2); ++i) {
			for (int j = 0; j < N; ++j) {
				if ((1<<j)&i) BITS[i].push_back(j);
			}
		}

		PREC = vector2<int>(N,X<<2,0);
		for (int i = 0; i < N; ++i) {
			for (int j = 0; j < (X<<2); ++j) {
				PREC[i][j] = count(i, j);
			}
		}

		vector<vector<int>> SUC(X);
		for (int i = 0; i < X; ++i) {
			gensuc(0, N-2, i, i, SUC[i]);
		}

		vector3<int> D(N, N-1, X, MOD);
		int ans = MOD;
		for (int k = 0; k < X; ++k) {
			D[0][0][k] = countprev(0, (k<<1)|1, -1, 0);
		}

		for (int i = 0; i < N-1; ++i) {
			for (int k = 0; k < X; ++k) {
				for (int j : BITS[(k<<1)|1]) {
					if (D[i][j][k] >= MOD) continue;
					for (int suc : SUC[k]) {
						if (suc == 0) continue;
						for (int l : BITS[suc<<1]) {
							if (!R[j][l]) continue;
							int cut = countprev((k<<1)|1, suc<<1, j, l);
							D[i+1][l][k^suc] = min(D[i+1][l][k^suc], D[i][j][k] + cut);
						}
					}

					if (R[j][N-1]) {
						int cur = min(MOD, D[i][j][k] + countprev((k << 1) | 1, ((1 << N) - 1) ^ ((k << 1) | 1), j, N - 1));
						ans = min(ans, cur);
					}
				}
			}
		}

		cout << ans << endl;

    }
};


int main() {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	F solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
	return 0;
}



Measured memory_bytes: 20604