#include <fstream>
using namespace std;
const int DOI18 = (1<<18), MAX = 18, INF = (1<<25);
int n, m, dp[DOI18][MAX], cost[MAX][MAX];
ifstream fin("hamilton.in");
ofstream fout("hamilton.out");
int main()
{
    int i, u, v, w, rez = INF, j, k;
    fin>>n>>m;
    for(i=0; i<n; i++) for(j=0; j<n; j++) cost[i][j] = INF;
    for(i=1; i<=m; i++){
        fin>>u>>v>>w;
        cost[u][v] = w;
    }
    for(i=0; i<DOI18; i++)
        for(j=0; j<n; j++) dp[i][j] = INF;
    dp[1][0] = 0;
    for(i=2; i<(1<<n); i++)
        for(j=1; j<n; j++)
            if(i & (1<<j))
                for(k=0; k<n; k++)
                    if((i & (1<<k)) and dp[i][j]>dp[i ^ (1<<j)][k] + cost[k][j])
                        dp[i][j] = dp[i ^ (1<<j)][k] + cost[k][j];
    for(i=1; i<n; i++)
        if(rez>dp[(1<<n)-1][i]+cost[i][0])
            rez = dp[(1<<n)-1][i]+cost[i][0];
    if(rez==INF)
        fout<<"Nu exista solutie\n";
    else
        fout<<rez<<'\n';
    return 0;
}