#include <algorithm>
#include <iostream>
#include <fstream>
#include <climits>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>

#include <iomanip>
#include <cassert>

#include <random>
#include <chrono>

// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

using ull = unsigned long long;
//using ll = long long;

//#define int __int128
//#define int ll
#define pii pair <int, int>
#define all(a) (a).begin(), (a).end()
#define fr first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound

#define vt vector
#define FOR(a, b) for(int i = (a); i <= (b); i++)
#define FORr(a, b) for(int i = (a); i >= (b); i--)
#define sz(x) (int)(x).size()

#define YES cout << "YES\n"
#define NO cout << "NO\n"

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int rangerng(int l, int r){
    return uniform_int_distribution<>(l, r)(rng);
}

string filename = "hamilton";
ifstream fin(filename + ".in");
ofstream fout(filename + ".out");

////////////////////////////////////////////////////////////////////////////////////

const int NMAX = 18;
const int INF = 1e9;

int dp[(1 << NMAX)][NMAX + 1];
int d[NMAX + 1][NMAX + 1];

vt <int> adj[NMAX + 1];
vt <int> radj[NMAX + 1];

void solve(){
    int n, m;
    fin >> n >> m;

    for(int i = 1; i <= m; i++){
        int a, b, c;
        fin >> a >> b >> c;
        ++a, ++b;
        d[a][b] = c;
        adj[a].pb(b);
        radj[b].pb(a);
    }

    for(int msk = 0; msk < (1 << n); msk++){
        for(int i = 0; i <= n; i++){
            dp[msk][i] = INF;
        }
    }

    dp[1][1] = 0;
    for(int msk = 1; msk + 1 < (1 << n); msk++){
        for(int i = 1; i <= n; i++){
            for(int vec : adj[i]){
                if(!((1 << (vec - 1)) & msk)){
                    dp[msk ^ (1 << (vec - 1))][vec] = min(dp[msk ^ (1 << (vec - 1))][vec], dp[msk][i] + d[i][vec]);
                }
            }
        }
    }

    int ans = INF;
    for(int vec : radj[1]){
        ans = min(ans, dp[(1 << n) - 1][vec] + d[vec][1]);
    }

    fout << ans << '\n';
}   


signed main(){

    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int T;
    //fin >> T;

    T = 1;

    while(T--){
        solve();
    }

    return 0;
}

/*
*/