#include <fstream>
#include <climits>
using namespace std;
ifstream fin("hamilton.in");
ofstream fout("hamilton.out");

int n, m, x, y, c, cost[18][18], inf, d[1 << 19][18];
int main()
{
    inf = 1000000000;
    fin >> 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){
        fin >> x >> y >> c;
        cost[x][y] = c;
    }

    for(int i = 1; i <= ((1 << n) - 1); ++i)
        for(int j = 0; j < n; ++j)
            d[i][j] = inf;
    d[1][0] = 0;
    for(int i = 1; i <= ((1 << n) - 1); ++i){
        for(int j = 0; (1 << j) <= i; ++j){
            if(i & (1 << j)){
                for(int k = 0 ; (1 << k) <= i; ++k)
                    if(i & (1 << k) && cost[k][j] != inf)
                        d[i][j] = min(d[i][j], d[i ^ (1 << j)][k] + cost[k][j]);
            }
        }
    }

    int mini = inf;
    for(int j = 0; j < n; ++j)
        mini = min(mini, d[(1 << n) - 1][j] + cost[j][0]);

    if(mini != inf)
        fout << mini;
    else
        fout << "Nu exista solutie";
    return 0;
}