#include <fstream>
#include <vector>
#include <stack>
#include <algorithm>
#define INF 0x3f3f3f3f
using namespace std;

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

using VI = vector<int>;
using VVI = vector<VI>;

int n, m, answ = INF;
VVI 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 ( int j = 0; j < n; ++j )
                    if ( !(mask & ( 1 << j )) && c[i][j] != INF )
                        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;
    c = VVI(n, VI(n, INF));
    int x, y;
    for ( int i = 1; i <= m; ++i )
    {
        is >> x >> y;
        is >> c[x][y];
    }
}