#include <iostream>
#include <vector>

#define NMAX 19
#define DOIN ((1 << 18) + 3)
#define INF ((1 << 30) - 1)

using namespace std;

typedef pair<int, int> pii;

int n, m, dp[DOIN][NMAX];
vector<pii> adj[NMAX];

int main()
{
    freopen("hamilton.in", "r", stdin);
    freopen("hamilton.out", "w", stdout);
    scanf("%d%d", &n, &m);
    for(int x, y, z, i = 1; i <= m; ++i) {
        scanf("%d%d%d", &x, &y, &z);
        adj[x].push_back({y, z});
    }

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

    dp[1][0] = 0;
    for(int mask = 1; mask < (1 << n); ++mask) {
        for(int i = 0; i < n; ++i) {
            if(mask & (1 << i)) {
                for(const auto &el : adj[i]) {
                    if(mask & (1 << el.first))
                        dp[mask][i] = min(dp[mask][i], dp[mask ^ (1 << i)][el.first] + el.second);
                }
            }
        }
    }
    int ans = INF;
    for(const auto &el : adj[0])
        ans = min(ans, dp[(1 << n) - 1][el.first] + el.second);
    if(ans == INF) printf("Nu exista solutie");
    else printf("%d", ans);
    return 0;
}