#include <bits/stdc++.h>
using namespace std;
ifstream fin("hamilton.in");
ofstream fout("hamilton.out");
const int NMAX = 18, MASK = (1 << 18), INF = 5e8;
int n, m, adj[NMAX][NMAX], dp[NMAX][MASK];
vector<pair<int, int>> trans[NMAX];

int Hamilton()
{
    for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++)
            if(adj[i][j] == 0)
                adj[i][j] = INF;
    fill(&dp[0][0], &dp[0][0] + NMAX * MASK, INF);
    dp[0][1] = 0;
    for(int mask = 0; mask < (1 << n); mask++)
    {
        for(int i = 0; i < n; i++)
        {
            if((1 << i) & mask)
                continue;
            for(int j = 0; j < n; j++)
            {
                if((1 << j) & mask)
                    dp[i][mask | (1 << i)] = min(dp[i][mask | (1 << i)], dp[j][mask] + adj[j][i]);
            }
        }
    }
    int min_cost = INF;
    for(auto [node, cost] : trans[0])
        min_cost = min(min_cost, dp[node][(1 << n) - 1] + cost);
    return min_cost;
}

int main()
{
    fin >> n >> m;
    while(m--)
    {
        int u, v, cost;
        fin >> u >> v >> cost;
        adj[u][v] = cost;
        trans[v].emplace_back(u, cost);
    }
    int min_cost = Hamilton();
    if(min_cost == INF)
        fout << "Nu exista solutie";
    else
        fout << min_cost;

    fin.close();
    fout.close();
    return 0;
}