#include <fstream>
#include <limits>

const int MAX_N = 18;
const int MAX_M = (MAX_N - 1) * MAX_N;
//const int INF = std::numeric_limits<int>::max() / 2;
const long long INF = 1LL << 60;

long long d[1 << MAX_N][MAX_N];
long long cost[MAX_N][MAX_N];

int main()
{
    std::ifstream fin("hamilton.in");
    int n, m;

    fin >> n >> m;
    for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++)
            cost[i][j] = i == j ? 0 : INF;

    for(int i = 0; i < m; i++)
    {
        int x, y, z;
        fin >> x >> y >> z;

        cost[x][y] = z;
    }

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

    for(int i = 3; i < (1 << n); i += 2)
        for(int j = 0; j < n; j++)
            for(int k = 0; k < n; k++)
                if(((1 << k) & i) != 0 && k != j)
                {
                    d[i][j] = std::min(d[i][j], d[i ^ (1 << j)][k] + cost[k][j]);
                }

    std::ofstream fout("hamilton.out");
    long long r = INF;

    for(int i = 0; i < n; i++)
        r = std::min(r, d[(1 << n) - 1][i] + cost[i][0]);

    if(r >= INF)
        fout << "Nu exista solutie";
    else
        fout << r;

    return 0;
}