/*
    Those without power, seek us!
    Those with power, fear us!
    We are the Order of the Black Knights!
*/

#include<fstream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define FITP(a,b) for(vector<pair<int,int> >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<ctime>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<set>
#define f cin
#define g cout
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned int
#define mod 1000000009LL
#define SQR 350
#define db double
#define inf 1<<30
#define div fdasfasd
#define hash dsafdsfds
#define od 100003
#define mod 666013
#define DIM 60010000
#define base 256
#define bas 255
#define N 19
#define inf 0x3f3f3f3f
using namespace std;
ifstream f("hamilton.in");
ofstream g("hamilton.out");
/*
    int dx[]={0,0,0,1,-1};
    int dy[]={0,1,-1,0,0};
*/
vector<pii > v[N],u;
int D[N][1<<N],x,y,c,n,m,sol;

int main ()
{
    f>>n>>m;
    FOR(i,1,m)
    {
        f>>x>>y>>c;
        ++x;
        ++y;
        v[x].pb(mp(y,c));
        if(y==1)
            u.pb(mp(x,c));
    }
    int li=(1<<n);
    li--;
    FOR(i,1,n)
    FOR(j,0,li)
    D[i][j]=inf;
    D[1][1]=0;
    FOR(i,1,li)
    FOR(j,1,n)
    if(D[j][i]!=inf)
    FITP(it,v[j])
    {
        if(!((1<<(it->fi-1))&i))
            D[it->fi][(1<<(it->fi-1))|i]=min(D[it->fi][(1<<(it->fi-1))|i],D[j][i]+it->se);
    }
    sol=inf;
    FITP(it,u)
    {
        sol=min(sol,D[it->fi][li]+it->se);
    }
    if(sol!=inf)
        g<<sol;
    else
        g<<"Nu exista solutie";
    return 0;
}