#include <iostream>
#include <fstream>

using namespace std;

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

const int INF = (1 << 30);
const int NMAX = 18;
const int PMAX = (1 << 18);

int n, m;
int cost[NMAX][NMAX];
int dp[PMAX][NMAX];

void citeste() {
    int a, b, c;

    f >> n >> m;
    for (int i = 1; i <= m; i++) {
        f >> a >> b >> c;
        cost[a][b] = c;
    }
}

int hamilton(int config, int nod) {
    if (dp[config][nod])
        return dp[config][nod];

    if (config == ((1 << n) - 1)) {
        if (cost[nod][0] == 0) return INF;
        dp[config][nod] = cost[nod][0];
        return dp[config][nod];
    }

    int d = INF;

    for (int i = 1; i < n; i++)
        if (cost[nod][i] != 0 && ((config & (1 << i)) == 0)) {
            d = min(d, cost[nod][i] + hamilton(config | (1 << i), i));
        }

    dp[config][nod] = d;
    return dp[config][nod];
}

int main() {
    citeste();
    int sol = hamilton(1 << 0, 0);
    if (sol == INF) g << "Nu exista solutie";
    else g << sol;
    g << '\n';
    return 0;
}