#include <fstream>
#include <vector>

using namespace std;

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

const int MAXN = 20;
const int MAXCONFIG = (1 << MAXN);
const int INF = MAXN * 1000000;

int N, M, sol = INF;
int cost[MAXN][MAXN], dp[MAXCONFIG][MAXN];
vector <int> v[MAXN];

void Read()
{
    fin >> N >> M;

    for(int i = 0; i < N; i++)
        for(int j = 0; j < N; j++)
            cost[i][j] = INF;

    int x, y, c;

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

    for(int i = 0; i < MAXCONFIG; i++)
        for(int j = 0; j < MAXN; j++)
            dp[i][j] = INF;
}

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

    for(int config = 0; config < (1 << N); config++)
        for(int f = 0; f < N; f++)
            if((config & (1 << f)) != 0) ///avem nodul terminal f in config
                for(auto vecin : v[f])
                    if((config & (1 << vecin)) != 0) ///avem nodul vecin in config
                        dp[config][f] = min(dp[config][f], dp[config ^ (1 << f)][vecin] + cost[vecin][f]);

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

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

void Write()
{

}

int main()
{
    Read();

    Solve();

    Write();

    return 0;
}