#include <fstream>
#include <vector>
#include <algorithm>
#define INF 0x3f3f3f3f
#define q g[nod][g[nod].size() - 1]
using namespace std;

ifstream is("hamilton.in");
ofstream os("hamilton.out");

using VI = vector<int>;
using VVI = vector<VI>;
using VP = vector<pair<int, int>>;
using VVP = vector<VP>;
using VPP = vector<pair<int, pair<int, int>>>;

int n, m, answ = INF;
VVI g, c, h;

void Read();

int main()
{
    Read();
    h = VVI(n, VI(1 << n, INF));
    h[0][1] = 0;
    for ( int mask = 1; mask < 1 << n; ++mask )
        for ( int i = 0; i < n; ++i )
            if ( mask & ( 1 << i) )
                for ( const auto &j : g[i] )
                    if ( !(mask & ( 1 << j ) ) )
                        h[j][mask | ( 1 << j )] = min(h[j][mask | ( 1 << j )], h[i][mask] + c[i][j]);
    for ( int i = 1; i < n; ++i )
        answ = min(answ, h[i][(1 << n) - 1] + c[i][0]);
    if ( answ == INF )
        os << "Nu exista solutie";
    else
        os << answ;
    is.close();
    os.close();
    return 0;
}

void Read()
{
    is >> n >> m;
    g = VVI(n);
    c = VVI(n, VI(n, INF));
    int x, y, z;
    for ( int i = 1; i <= m; ++i )
    {
        is >> x >> y >> z;
        g[x].push_back(y);
        c[x][y] = z;
    }
}