#include <bits/stdc++.h>
#define cin ci
#define cout co
using namespace std;
ifstream cin("hamilton.in");
ofstream cout("hamilton.out");
const int INF = 1e9;
int n, m;
vector<vector<int>> graf;
vector<vector<int>> dp;
int hamilton()
{
    for(int mask = 0; 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))
                        dp[mask][i] = min(dp[mask][i], dp[mask ^ (1 << i)][j] + graf[j][i]);
    int ans = INF;
    for(int i = 0; i < n; i++)
        ans = min(ans , dp[(1 << n) - 1][i] + graf[i][0]);
    return ans;
}
int main()
{
    cin >> n >> m;
    int x, y, z;
    graf.assign(n + 1, vector<int>(n + 1, INF));
    dp.assign((1 << n), vector<int> (n + 1, INF));
    dp[1][0] = 0;
    for(int i = 1; i <= m; i++)
    {
        cin >> x >> y >> z;
        graf[x][y] = z;
    }
    int res = hamilton();
    if(res == INF)
        cout << "Nu exista solutie";
    else
        cout << res;
    return 0;
}