#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>

using namespace std;

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

const int INF = 1e9;
vector<vector<int>> adj;
int n, m, sol;
int cost[20][20], c[262150][20];

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

    memset(cost, INF, sizeof cost);

    for(int i = 1; i < (1 << n); i++)
        for(int j = 0; j < n; j++)
            c[i][j] = INF;

    adj.resize(m + 5);

    for(int i = 1; i <= m; i++)
    {
        int x, y;
        in >> x >> y;
        in >> cost[x][y];

        adj[y].push_back(x);
    }

    c[1][0] = 0;

    for(int i = 1; i < (1 << n); i++)
    {
        for(int j = 0; j < n; j++)
        {
            if(i & (1 << j))
            {
                int len = adj[j].size();

                for(int k = 0; k < len; k++)
                    if(i & (1 << adj[j][k]))
                        c[i][j] = min(c[i][j], c[i ^ (1 << j)][adj[j][k]] + cost[adj[j][k]][j]);
            }
        }
    }

    sol = INF;

    for(int i = 0; i < adj[0].size(); ++i)
		sol = min(sol, c[(1<<n) - 1][adj[0][i]] + cost[adj[0][i]][0]);

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

    return 0;
}