#include <bits/stdc++.h>
#define Inf (1<<30)
using namespace std;

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

int n, m;
vector < int > gf[18];
int cost[18][18];
int dp[18][1<<18];


int main()
{
    fin>>n>>m;
    for(int a, b, c, i = 0; i<m; i++)
    {
        fin>>a>>b>>c;
        gf[b].push_back(a);
        cost[a][b] = c;
    }
    for(int i = 0; i<(1<<n); i++)
        for(int nod = 0; nod < n; nod++)
            dp[nod][i] = Inf;

    dp[0][1<<0] = 0;

    for(int i = 1; i <(1<<n); i++)
        for(int nod = 0; nod < n; nod++)
            if(i & (1<<nod))
            {
                for(auto a : gf[nod])
                    if(i & (1<<a))
                        dp[nod][i] = min(dp[nod][i], dp[a][i - (1<<nod)] + cost[a][nod] );
            }


    int minim = Inf;
    for(auto a: gf[0])
        minim = min(dp[a][(1<<n) - 1] + cost[a][0], minim);

    fout<<minim;

    return 0;
}