#include <iostream>
#include <cstdio>
#include <vector>
#define INF 0x3f3f3f3f

using namespace std;
vector <int> g[18];
int n,m,a,b,c;
int ct[18][18];
int d[1<<18][18];
void dfs(int nod, int drum, int cost)
{
    d[drum][nod]=min(d[drum][nod],cost);
    for(int i: g[nod])
        if(!(drum&(1<<i)))
            dfs(i,drum+(1<<i),d[drum][nod]+ct[nod][i]);
}
int main()
{
    freopen("hamilton.in","r",stdin);
    freopen("hamilton.out","w",stdout);
    scanf("%d %d", &n,&m);
    for(int i=0;i<m;++i)
    {
        scanf("\n%d %d %d", &a,&b,&c);
        g[a].push_back(b);
        ct[a][b]=c;
    }
    for(int i=0;i<(1<<n);++i)
        for(int j=0;j<n;++j)
            d[i][j]=INF;
    dfs(0,1,0);
    int rez=INF;
    for(int i=1;i<n;++i)
        if(ct[i][0])
            rez=min(rez,d[(1<<n)-1][i]+ct[i][0]);
    cout<<rez;
    return 0;
}