#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <iomanip>
#include <algorithm>

using namespace std;

const string filename = "hamilton";
ifstream fin(filename + ".in");
ofstream fout(filename + ".out");

int inf = 0x3f3f3f3f;
int n, m, dp[(1 << 18) + 5][20], cost[20][20], full, ans;
vector <int> G[20];

int main()
{
    fin >> n >> m;
    for(int x, y, c, i = 1; i <= m; i++)
    {
        fin >> x >> y >> c;
        cost[x][y] = c;
        G[y].push_back(x);
    }
    full = (1 << n) - 1;
    for(int config = 0; config <= full; config++)
        for(int i = 0; i < n; i++)
            dp[config][i] = inf;
    dp[1][0] = 0;
    for(int config = 1; config <= full; config++)
        for(int nod = 0; nod < n; nod++)
            if(config & (1 << nod))
                for(int vecin : G[nod])
                    if(config & (1 << vecin))
                        dp[config][nod] = min(dp[config][nod], dp[config ^ (1 << nod)][vecin] + cost[vecin][nod]);
    ans = inf;
    for(int vecin : G[0])
        ans = min(ans, dp[full][vecin] + cost[vecin][0]);
    if(ans == inf)
        fout << "Nu exista solutie";
    else
        fout << ans;
    return 0;
}