#include <fstream>
#include <vector>

using namespace std;

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

const int NMAX = 18;
const int CONFIGMAX = (1 << NMAX);
const int INF = NMAX * 1000000;

int N, M, sol = INF;
int cost[NMAX + 5][NMAX + 5], dp[CONFIGMAX + 5][NMAX + 5];

vector <int> g[NMAX + 5];

void Read()
{
    int x, y, c;

    fin >> N >> M;

    ///init
    for(int i = 0; i < NMAX; i++)
        for(int j = 0; j < NMAX; j++)
            cost[i][j] = INF;

    for(int i = 0; i < CONFIGMAX; i++)
        for(int j = 0; j < NMAX; j++)
            dp[i][j] = INF;

    ///inverse graph
    for(int i = 1; i <= M; i++)
    {
        fin >> x >> y >> c;
        cost[x][y] = c;
        g[y].push_back(x);
    }
}

void Solve()
{
    dp[1][0] = 0;

    ///dp
    for(int config = 0; config < (1 << N); config++)
        for(int f = 0; f < N; f++)
            if(config & (1 << f))
                for(auto it : g[f])
                    if(config & (1 << it))
                        dp[config][f] = min(dp[config][f], dp[config ^ (1 << f)][it] + cost[it][f]);

    int sol = INF;

    for(auto it : g[0])
        sol = min(sol, dp[(1 << N) - 1][it] + cost[it][0]);

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

int main()
{
    Read();

    Solve();

    return 0;
}