#include <fstream>
#include <climits>
#define NMAX 20
using namespace std;

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

int N, M;
const long long INFLL = (1LL << 60);
long long cmin;
int ok;
int A[NMAX][NMAX];
int x[NMAX], best_sol[NMAX];

void citire()
{
    fin >> N >> M;
    for (int i = 0; i < N; ++i)
        for (int j = 0; j < N; ++j)
            A[i][j] = -1;
    for (int k = 0; k < M; ++k)
    {
        int u, v, cost;
        fin >> u >> v >> cost;

        if (u >= 0 && u < N && v >= 0 && v < N)
            A[u][v] = cost;
    }
}

void prelucrare_sol()
{
    long long total = 0;
    for (int i = 1; i < N; ++i)
    {
        int cu = x[i - 1], cv = x[i];
        if (A[cu][cv] == -1) return;
        total += (long long)A[cu][cv];
        if (total >= cmin) return;
    }
    if (A[x[N - 1]][x[0]] == -1) return;
    total += (long long)A[x[N - 1]][x[0]];
    if (total < cmin)
    {
        cmin = total;
        for (int i = 0; i < N; ++i) best_sol[i] = x[i];
        ok = 1;
    }
}

void BACK(int k)
{
    if (k == 1)
    {
        prelucrare_sol();
        return;
    }
    for (int i = 0; i < k; ++i)
    {
        BACK(k - 1);
        if (k % 2 == 1)
        {
            int tmp = x[0];
            x[0] = x[k - 1];
            x[k - 1] = tmp;
        }
        else
        {
            int tmp = x[i];
            x[i] = x[k - 1];
            x[k - 1] = tmp;
        }
    }
}

int main()
{
    citire();

    for (int i = 0; i < N; ++i) x[i] = i;
    cmin = INFLL;
    ok = 0;
    BACK(N);
    if (ok)
    {
        fout << cmin << "\n";
    }
    else
    {
        fout << "Nu exista solutie\n";
    }
    return 0;
}