#include <bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define N 50005
#define INF 1e8
using namespace std;
ifstream fin("hamilton.in");
ofstream fout("hamilton.out");
typedef long long ll;
vector <int> g[20];
int cost[20][20],dp[20][1<<18],minn=INF;
int n,m,x,y,c;
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        g[y].pb(x);
        cost[x][y]=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 it : g[nod])
                    if(i&(1<<it))
                        dp[nod][i]=min(dp[nod][i],dp[it][i-(1<<nod)]+cost[it][nod]);
            }

    for(auto it : g[0])
        minn=min(dp[it][(1<<n)-1]+cost[it][0],minn);
    if(minn!=INF)
        fout<<minn;
    else
        fout<<"Nu exista solutie";
    return 0;
}