#include <bits/stdc++.h>

using namespace std;

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

constexpr int INF = 0x3f3f3f3f;
constexpr int NMAX=18, MMAX=262144;

vector <int> G[NMAX];

int n, m, x, y, c;

int cost[NMAX][NMAX];

int dp[NMAX][MMAX];

inline void citire ()
{
    f >> n >> m;

    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < n; ++j)
            cost[i][j] = INF;
    }

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

        G[y].push_back(x);

        cost[x][y] = c;
    }
}

inline int functie (int x, int S)
{
    int val = INF;

    for (int k = 0; k < G[x].size(); ++k)
        if (G[x][k] != x && (S & (1<<G[x][k])) != 0 && cost[G[x][k]][x] < INF && S >= (1<<x))
            val = min(val, cost[G[x][k]][x] + dp[G[x][k]][S - (1<<x)]);

    return val;
}

inline void fac_dinamica ()
{
    for (int j = 0; j < (1 << n); ++j)
    {
        for (int i = 0; i < n; ++i)
        {
            if (i == 0 && j == 1) dp[i][j] = 0;

            else if ((j & (-j)) == j) dp[i][j] = INF;

            else if (j == (1 << i)) dp[i][j] = INF;

            else if(dp[i][j] != INF)
                dp[i][j] = functie(i, j);
        }
    }
}

inline void solve()
{
    int sol = INF;

    for (int i = 0; i < G[0].size(); ++i)
        sol = min(sol, dp[G[0][i]][(1<<n)-1] + cost[G[0][i]][0]);

    if (sol == INF)
    {
        g <<"Nu exista solutie" << '\n';

        return;
    }

    g << sol << '\n';
}

int main()
{
    f.tie(NULL);

    citire();

    fac_dinamica();

    solve();

    return 0;
}