#include <fstream>
#include <vector>
#include <cstring>
using namespace std;
ifstream in("hamilton.in");
ofstream out("hamilton.out");
const int NMax = 20;
const int MMax = 262150;
const int oo = 1000000000;
int N, M, Sol;
vector <int> V[NMax];
int DP[MMax][NMax];
int Cost[NMax][NMax];
int Function_DP(int config, int prec)
{
    if (DP[config][prec] == -1)
    {
        DP[config][prec] = oo;

        for (int i = 0; i < V[prec].size(); i++)
            if (config & (1 << V[prec][i]))
            {
                DP[config][prec] = min(DP[config][prec], Function_DP(config ^ (1<<prec), DP[prec][i]) + Cost[DP[prec][i]][prec]);
            }
    }
    return DP[config][prec];
}
void Read()
{
    in >> N >> M;
    for (int i = 1; i <= M; i++)
    {
        int x, y;
        in >> x >> y;
        V[y].push_back(x);
        in >> Cost[x][y];
    }
}
void Solve ()
{
    Sol = oo;
    for (int i = 0; i < N; ++i)
        for (int j = 0; j < N; ++j) Cost[i][j] = oo;
    memset(DP, -1, sizeof(DP));
    DP[1][0] = 0;
    for (int i = 0; i < V[0].size(); i++)
        Sol = min(Sol, Function_DP((1<<N)-1, V[0][i]) + Cost[V[0][i]][0]);
}
void Print ()
{
    if (Sol == oo) out << "Nu exista solutie" << '\n';
    else out << Sol << '\n';
}
int main()
{
    Read();
    Solve();
    Print();
    return 0;
}