#include <fstream>
#include <vector>
#include <algorithm>
#include <climits>
using namespace std;

const int MAXN = 18;
const int INF = 2000000000;

int N, M;
int cost[MAXN][MAXN];
int dp[1 << MAXN][MAXN];

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

    fin >> N >> M;

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

    for (int i = 0; i < M; ++i) {
        int x, y, c;
        fin >> x >> y >> c;
        cost[x][y] = c;
    }

    int fullMask = (1 << N) - 1;

    for (int mask = 0; mask < (1 << N); ++mask)
        for (int i = 0; i < N; ++i)
            dp[mask][i] = INF;

    dp[1][0] = 0;

    for (int mask = 1; mask < (1 << N); ++mask) {
        for (int i = 0; i < N; ++i) {
            if (!(mask & (1 << i))) continue;
            if (dp[mask][i] == INF) continue;
            for (int j = 0; j < N; ++j) {
                if (mask & (1 << j)) continue;
                if (cost[i][j] == INF) continue;
                int newMask = mask | (1 << j);
                if (dp[mask][i] + cost[i][j] < dp[newMask][j])
                    dp[newMask][j] = dp[mask][i] + cost[i][j];
            }
        }
    }

    int ans = INF;
    for (int i = 1; i < N; ++i) {
        if (cost[i][0] != INF && dp[fullMask][i] != INF) {
            ans = min(ans, dp[fullMask][i] + cost[i][0]);
        }
    }

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

    fin.close();
    fout.close();
    return 0;
}