#include <bits/stdc++.h>

using namespace std;

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

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


int main() {
    ifstream fin( "hamilton.in" );
    ofstream fout( "hamilton.out" );
    int n, i, j, m, a, b;
    fin >> n >> m;
    for ( i = 0; i < n; i ++ ) {
        for ( j = 0; j < n; j ++ )
            cost[i][j] = INF;
    }
    for ( i = 0; i < m; i ++ ) {
        fin >> a >> b;
        fin >> cost[a][b];
    }
    for ( i = 0; i < n; i ++ ) {
        for ( j = 0; j < ( 1 << n ); j ++ ) {
            dp[i][j] = INF;
        }
    }
    dp[0][1] = 0;
    for ( j = 0; j < ( 1 << n ) - 1; j ++ ) {
        for ( i = 0; i < n; i ++ ) {
            if ( j & ( 1 << i ) ) {
                for ( int k = 0; k < n; k ++ ) {
                    if ( !(j & ( 1 << k )) ) {
                        dp[k][j | ( 1 << k )] = min( dp[k][j | ( 1 << k )], dp[i][j] + cost[i][k] );
                    }
                }
            }
        }
    }
    int ans = INF;
    for ( i = 1; i < n; i ++ ) {
        ans = min( ans, dp[i][( 1 << n ) - 1] + cost[i][0] );
    }
//    cout << ans << '\n';
    if ( ans != INF )
        fout << ans << '\n';
    else
        fout << "Nu exista solutie";
    return 0;
}