#include <fstream>
#include <vector>
#include <utility>

using namespace std;

const int NMAX = 18;
const int INF = 1E9;

int N, M;
vector <pair <int, int> > graph[NMAX + 1];

bool vis[NMAX][1 << NMAX];
int dp[NMAX][1 << NMAX];

int backtr(int node, int mask) { //O(2 ^ N * N ^ 2)
    if (vis[node][mask])
        return dp[node][mask];
    vis[node][mask] = true;

    int ans = INF;
    if (mask == ((1 << N) - 1)) {
        for (int i = 0; i < graph[node].size(); ++ i)
            if (graph[node][i].first == 0)
                ans = graph[node][i].second;
    }
    else {
        for (int i = 0; i < graph[node].size(); ++ i)
            if (!(mask & (1 << (graph[node][i].first)))) {
                int current = graph[node][i].second + backtr(graph[node][i].first, mask | (1 << (graph[node][i].first)));
                if (current < ans)
                    ans = current;
            }
    }

    dp[node][mask] = ans;
    return ans;
}

int main()
{
    ifstream cin("hamilton.in");
    ofstream cout("hamilton.out");

    cin >> N >> M;

    for (int i = 0; i < M; ++ i) {
        int a, b, c;
        cin >> a >> b >> c;
        graph[a].push_back(make_pair(b, c));
    }

    int ans = backtr(0, 1);
    if (ans == INF)
        cout << "Nu exista solutie\n";
    else
        cout << ans << '\n';
    return 0;
}