#include <fstream>
#include <vector>

using namespace std;

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

int n, m, i, j, x, y, c, dp[19][262210], sol;
bool iscalc[19][262210];
int edges[21][21];

int calcDP(int node, int mask)
{
    if (iscalc[node][mask])
        return dp[node][mask];
    int mask2 = (mask ^ (1 << (node-2)));
    if (!mask2) {
        if (edges[1][node])
            dp[node][mask] = edges[1][node];
    }
    else {
        for (int i = 0; i < n-1; i++)
        {
            if ((mask2 & (1<<i)) && edges[i+2][node])
            {
                dp[node][mask] = min(dp[node][mask], calcDP(i+2, mask2) + edges[i+2][node]);
            }
        }
    }
    iscalc[node][mask] = true;
    return dp[node][mask];
}

int main()
{
    f >> n >> m;
    for (i = 1; i <= m; i++) {
        f >> x >> y >> c;
        x++;
        y++;
        edges[x][y] = c;
    }
    for (i = 1; i <= 18; i++)
        for (j = 0; j < (1<<n); j++)
            dp[i][j] = 50000000;
    dp[1][0] = 0;
    iscalc[1][0] = true;
    sol = 30000000;
    for (i = 2; i <= n; i++) {
        if (edges[i][1]) {
            calcDP(i, (1<<(n-1))-1);
            sol = min(sol, dp[i][(1<<(n-1))-1] + edges[i][1]);
        }
    }
    if (sol == 30000000)
        g << "Nu exista solutie";
    else
        g << sol;
    f.close();
    g.close();
    return 0;
}