#include <bits/stdc++.h>

using namespace std;

ifstream fin ("hamilton.in");
ofstream fout("hamilton.out");

const int N_MAX = 18 + 5;
const int inf = 0x3f3f3f3f;

int n, m;
int cst[N_MAX][N_MAX], dp[(1<<18) + 5][N_MAX];

bool isbit(int mask, int i){
    return (mask & (1 << i));
}

int main()
{
    fin >> n >> m;

    memset(cst, inf, sizeof(cst));

    while(m--){
        int a, b, c;
        fin >> a >> b >> c;
        cst[a][b] = c;
    }

    memset(dp, inf, sizeof(dp));

    dp[1][0] = 0;

    for(int mask = 1; mask < (1<<n); ++mask){
        for(int i = 0; i<n; ++i){
            if(isbit(mask, i)){
                for(int j = 0; j<n; ++j){
                    if(!isbit(mask, j) and cst[i][j]){
                        dp[mask + (1<<j)][j] = min( dp[mask][i] + cst[i][j] , dp[mask + (1<<j)][j] );
                    }
                }
            }
        }
    }

    int ans = inf;

    for(int i = 0; i<n; ++i)
        ans = min( ans , dp[(1<<n) - 1][i] + cst[i][0]);

    if(ans < inf)
        fout << ans;
    else fout << "Nu exista solutie";

    return 0;
}