#include <iostream>
#include <vector>
#include <fstream>
#define INF 1000000000
#define pii pair<int,int>

using namespace std;

ifstream fin ("hamilton.in");
ofstream fout ("hamilton.out");

vector < pii > v[20];

int n, m, x, y, z, nod, cost, ans;
int dp[20][20];
int Cost[20][20];


int main() {
    fin >> n >> m;
    
    for (int i=0; i<n; i++)
        for (int j=0; j<n; j++)
            Cost[i][j] = INF;
    
    for (int i = 0; i < (1<<n); i++)
        for (int j=0; j<n; j++)
            dp[i][j] = INF;
    
    dp[1][0] = 0;
    
    for (int i=1; i<=m; i++)
    {
        fin >> x >> y >> z;
        v[y].push_back({x, z});
        Cost[y][x] = z;
    }
    
    for (int i = 0; i < (1<<n); i++)
        for (int j = 0; j < n; j++)
            if (i & (1 << j))
                for (auto it : v[j])
                {
                    nod = it.first;
                    cost = it.second;
                    if (i & (1 << it.first))
                        dp[i][j] = min (dp[i][j], dp[i ^ (1 << j)][nod] + cost);
                }
    ans = INF;
    for (int j = 0; j<n; j++)
        ans = min (ans, dp[(1<<n)-1][j] + Cost[0][j]);
    
    if (ans == INF)
        fout << "Nu exista solutie";
    else
        fout << ans;
    
    return 0;
}