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

using namespace std;

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

const int INF = 0x3f3f3f3f3f3f3f3f;

int n, m;
int dp[(1 << 18) + 10][20];
vector<vector<pair<int, int>>> adj;

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

    adj.resize(n + 5);

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

        adj[y].emplace_back(x, c);
    }

    memset(dp, INF, sizeof dp);

    for(int i = 0; i < n; i++)
        dp[1][i] = 0;

    for(int i = 1; i < 1 << n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            if(i & (1 << j))
            {
                for(auto it: adj[j])
                    if(i & (1 << it.first))
                        dp[i][j] = min(dp[i][j], dp[i ^ (1 << j)][it.first] + it.second);
            }
        }
    }

    int ans = INF;

    for(auto it: adj[0])
        ans = min(ans, dp[(1 << n) - 1][it.first] + it.second);

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

    return 0;
}