#include <fstream>
#include <vector>
#include <bitset>

using namespace std;

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

#define MAX_VERTICES 18
#define MAX_COST 1000000

int n, m, minimCost = MAX_COST * MAX_VERTICES, foundCycle;
vector <vector <pair <int,int> > > graph;
vector <int> sol;
bitset <MAX_VERTICES + 1> marked;

void readGraph()
{
    in >> n >> m;
    graph.resize(n + 1);
    sol.resize(n + 1);
    for(int i = 1; i <= m; i ++)
    {
        int a, b, c;
        in >> a >> b >> c;
        a ++;
        b ++;
        graph[a].push_back({b, c});
    }
}

void checkCycle()
{
//    for(int i = 0; i < n; i++)
//        out << sol[i] << " ";
//    out << "\n";
//    sol[0] = 1;
//    sol[1] = 4;
//    sol[2] = 3;
//    sol[3] = 5;
//    sol[4] = 2;
    sol[n] = sol[0];
    int sum = 0;
    for(int i = 0; i < n; i++)
    {
        int node = sol[i];
        bool ok = 0;
//        out << sol[i] << " ";
        for(auto x : graph[node])
        {
//            out << x.first << " ";
            if(x.first == sol[i + 1])
            {
                ok = 1;
                sum += x.second;
            }
        }
//        out << "\n";
        if(ok == 0)
        {
//            out << sol[i] << " ";
            return;
        }
    }
    foundCycle = 1;
    minimCost = min(minimCost, sum);
}

void bkt(int k)
{
    if(k == n)
        checkCycle();
    for(int i = 1; i <= n; i++)
    {
        if(!marked[i])
        {
            sol[k] = i;
            marked[i] = 1;
            bkt(k + 1);
            marked[i] = 0;
        }
    }
}

int main()
{
    readGraph();

    bkt(0);

    if(foundCycle)
        out << minimCost;
    else
        out << "Nu exista solutie";
    return 0;
}