#include <bits/stdc++.h>
#define MAX 1000000000
using namespace std;

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

struct Elem
{
    int dest, cost;
};

vector <Elem> v[20];

int dp[20][300005];

int main()
{
    int N, M;

    fin >> N >> M;

    for(int i = 1; i <= M; i++)
    {
        int x, y, z;

        fin >> x >> y >> z;

        v[y].push_back({x, z});
    }

    for(int i = 0; i < N; i++)
        for(int j = 0; j <= (1 << N); j++)
            dp[i][j] = MAX;

    dp[0][1] = 0;

    for(int mask = 2; mask < (1 << N); mask ++)
        for(int j = 0; j < N; j++)
    {
        if(mask & (1 << j))
        {
            int val = mask ^ (1 << j);

            for(auto it : v[j])
                if(val & (1 << it.dest))
                dp[j][mask] = min(dp[j][mask], dp[it.dest][val] + it.cost);
        }
    }

    int ans = MAX;

    for(auto it : v[0])
        ans = min(ans, dp[it.dest][(1 << N) - 1] + it.cost);

    if(ans == MAX)
        fout << "Nu exista solutie" << '\n';
    else
        fout << ans;
    return 0;
}