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

using namespace std;

#define pii pair <int, int>

string filename = "hamilton";

#ifdef LOCAL
    ifstream fin("input.in");
    ofstream fout("output.out");
#else
    ifstream fin(filename + ".in");
    ofstream fout(filename + ".out");
#endif

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

vector <pii> adj[NMAX + 1];
vector <pii> radj[NMAX + 1];

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

int main(){

    int n, m;
    fin >> n >> m;

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

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

    dp[1][0] = 0;

    for(int msk = 1; msk < (1 << n) - 1; msk++){
        for(int i = 0; i < n; i++){
            if((msk & (1 << i)) != 0){
                for(pii vec : adj[i]){
                    if((msk & (1 << vec.first)) == 0 && dp[msk][i] + vec.second < dp[msk ^ (1 << vec.first)][vec.first]){
                        dp[msk ^ (1 << vec.first)][vec.first] = dp[msk][i] + vec.second;
                    }
                }
            }
        }
    }

    int ans = INF;
    for(pii vec : radj[0]){
        if(dp[(1 << n) - 1][vec.first] + vec.second < ans){
            ans = dp[(1 << n) - 1][vec.first] + vec.second;
        }
    }

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

    return 0;
}