#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>

#define vt vector
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define pii pair <int, int>

#define fr first 
#define sc second

using namespace std;

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

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

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

int d[NMAX + 1][NMAX + 1];
int dp[(1 << 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;
        adj[a].pb(b);
        radj[b].pb(a);
        d[a][b] = c;
    }

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

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

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

    if(ans == INF){
        fout << "Nu exista solutie\n";
        return;
    }
    fout << ans << '\n';
}

int main(){

    int T;
    //fin >> T;

    T = 1;

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

    return 0;
}