#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define sar(a,n) {cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl;}

using namespace std;

template<typename S,typename T>auto&operator<<(ostream&o,pair<S,T>p){return o<<"{"<<p.fi<<","<<p.se<<"}";}
template<typename T>auto&operator<<(ostream&o,set<T>s){for(auto&e:s)o<<e<<" ";return o;}
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,priority_queue<S,T,U>q){while(!q.empty())o<<q.top()<<" ",q.pop();return o;}
template<typename K,typename T>auto&operator<<(ostream&o,map<K,T>&m){for(auto&e:m)o<<e<<" ";return o;}
template<typename T>auto&operator<<(ostream&o,vector<T>v){for(auto&e:v)o<<e<<" ";return o;}
void ashow(){cout<<endl;}template<typename T,typename...A>void ashow(T t,A...a){cout<<t<<" ";ashow(a...);}
template<typename S,typename T,typename U>
struct TRI{S fi;T se;U th;TRI(){}TRI(S f,T s,U t):fi(f),se(s),th(t){}
bool operator<(const TRI&_)const{return(fi==_.fi)?((se==_.se)?(th<_.th):(se<_.se)):(fi<_.fi);}};
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,TRI<S,T,U>&t){return o<<"{"<<t.fi<<","<<t.se<<","<<t.th<<"}";}

typedef pair<int, int> P;
typedef pair<ll, ll> pll;
typedef TRI<int, int, int> tri;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<P> vp;
typedef vector<double> vd;
typedef vector<string> vs;

const int MAX_N = 100005;

int dp[1<<15][15];
int cl[1<<15];
int c[15][15];

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    int sm = 0;
    rep(i,m){
        int x, y, z;
        cin >> x >> y >> z;
        --x, --y;
        sm += (c[x][y] = c[y][x] = z);
    }
    rep(i,1<<n){
        if(__builtin_popcount(i) <= 1) continue;
        vi ten;
        rep(j,n){
            if(i>>j&1) ten.pb(j);
        }
        rep(j,(int)ten.size()){
            srep(k,j+1,(int)ten.size()){
                cl[i] += c[ten[j]][ten[k]];
            }
        }
    }
    rep(i,1<<n) rep(j,n) dp[i][j] = -INF;
    dp[1][0] = 0;
    srep(i,1,(1<<n)-1){
        rep(j,n){
            if(dp[i][j] == -INF) continue;
            int rem = (((1<<n)-1)^i);
            if(!(i>>(n-1)&1)) rem ^= (1<<(n-1));
            for(int k=rem; k>0; k=(k-1)&rem){
                cmx(dp[i^k][j], dp[i][j] + cl[k^(1<<j)]);
            }
            if(!(i>>(n-1)&1)) rem ^= (1<<(n-1));
            rep(k,n){
                if(rem>>k&1 && c[j][k]) cmx(dp[i^(1<<k)][k], dp[i][j] + c[j][k]);
            }
        }
    }
    int mx = 0;
    rep(i,1<<n){
        cmx(mx, dp[i][n-1]);
    }
    cout << sm - mx << "\n";
    return 0;
}

Measured memory_bytes: 2304