// deoarece avem ciclu, putem considera oricare nod ca nod de start / final
#include <bits/stdc++.h>
#define fi first
#define se second 
#define ll long long

using namespace std;

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

int n, m, x, y, c;
int dist[18][18];
int dp[1 << 18][18];

int main() {
    in >> n >> m;
    for (int i = 0; i < m; i++) {
        in >> x >> y >> c;
        dist[x][y] = c;
    }

    int limit = (1 << n);
    for (int mask = 1; mask < limit; mask++) {
        for (int node = 0; node < n; node++) {
            dp[mask][node] = INT_MAX;
        }
    }
    // consideram 0 ca fiind nod de start
    dp[1][0] = 0;

    for (int mask = 1; mask < limit; mask++) {
        if (__builtin_popcount(mask) == 1) {
            continue;
        }

        for (int node = 0; node < n; node++) {
            if (mask & (1 << node)) {
                int prevMask = (mask ^ (1 << node));
                for (int prevNode = 0; prevNode < n; prevNode++) {
                    if (prevMask & (1 << prevNode) && dp[prevMask][prevNode] != INT_MAX) {
                        if (dist[prevNode][node]) {
                            dp[mask][node] = min(dp[mask][node], dp[prevMask][prevNode] + dist[prevNode][node]);
                        }
                    }
                }
            }
        }
    }

    int ans = INT_MAX;
    for (int node = 1; node < n; node++) {
        if (dp[limit - 1][node] != INT_MAX && dist[node][0]) {
            ans = min(ans, dp[limit - 1][node] + dist[node][0]);
        }
    }

    if (ans == INT_MAX) {
        out << "Nu exista solutie";
    } else {
        out << ans;
    }

    return 0;
}