#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
int n,m,c[16][16],dp[16][272145],ans=INF;
vector<int>g[16];
int32_t main(){
CODE_START;
ifstream cin("hamilton.in");
ofstream cout("hamilton.out");
cin>>n>>m;
for(int i=1;i<=m;i++)
{
    int x,y,z;
    cin>>x>>y>>z;
    g[x].pb(y);
    c[x][y]=z;
}
for(int i=0;i<(1<<n);i++)
{
    for(int j=0;j<n;j++)
    {
        dp[j][i]=INF;
    }
}
dp[0][1]=0;
for(int i=0;i<(1<<n);i++)
{
    for(int j=0;j<n;j++)
    {

        if(((1<<j)&i)&&dp[j][i]!=INF){
            for(auto it : g[j]){
                if(((1<<it)&i)==0){
                    dp[it][i+(1<<it)]=min(dp[it][i+(1<<it)],dp[j][i]+c[j][it]);
                }
            }
        }
    }
}
for(int i=1;i<n;i++)
{
    if(c[i][0]&&dp[i][(1<<n)-1]){
        ans=min(ans,dp[i][(1<<n)-1]+c[i][0]);
    }
}
if(ans==LINF){
    cout<<"Nu exista solutie"<<endl;
return 0;
}
cout<<ans<<endl;
}