#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> void Max(T &m, const T q) { if (m < q) m = q; }
template<typename T> void Min(T &m, const T q) { if (m > q) m = q; }
template<typename T1, typename T2> pair<T1, T2> operator+(pair<T1, T2> &l, pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(pair<T1, T2> &l, pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;


int N, M;
vector<vector<int>> edge;
vector<int> subset;
int INF = 2E9;

int main()
{
    cin >> N >> M;

    ndarray(edge, N, N);
    int sum_edge = 0;
    REP(_, M)
    {
        int a, b, c; cin >> a >> b >> c;
        a--; b--;
        edge[a][b] = edge[b][a] = c;
        sum_edge += c;
    }

    subset.resize(1 << N);
    FOR(S, 1, 1 << N)
    {
        int d = __builtin_ctz(S);
        subset[S] = subset[S - (1 << d)];
        REP(t, N) if (S & (1 << t)) subset[S] += edge[d][t];
    }

    vector<vector<int>> dp(1 << N);
    REP(S, 1 << N)
    {
        dp[S].resize(N, -INF);
        if (S & 1) dp[S][0] = subset[S];
    }

    REP(S, 1 << N) REP(now, N) if (S & (1 << now))
    {
        REP(nxt, N) if (edge[now][nxt] > 0 && (S & (1 << nxt)) == 0)
        {
            int CS = (1 << N) - 1 - S - (1 << nxt); // 補集合
            for (int ss = CS; ; ss = (ss - 1) & CS)
            {
                Max(dp[S + (1 << nxt) + ss][nxt], dp[S][now] + edge[now][nxt] + subset[ss + (1 << nxt)]);
                if (ss == 0) break;
            }
        }
    }

    int ans = 0;
    REP(S, 1 << N) if ((S >> (N - 1)) & 1) Max(ans, dp[S][N - 1]);
    cout << sum_edge - ans << endl;
}


Measured memory_bytes: 3712