#include <bits/stdc++.h>

using namespace std;

ifstream f("hamilton.in");
ofstream g("hamilton.out");

struct muchii{
    int node, cost;
};

int n,m,x,y,z,minim=INT_MAX,dp[20][300000];
vector <muchii> edges[20];
queue <muchii> q;
bitset <300000> inque[20];

void dfs(int x,int masca)
{
    q.push({x,masca});
    while(!q.empty())
    {
        x=q.front().node, masca=q.front().cost;
        q.pop(), inque[x][masca]=0;
        for(auto y:edges[x])
        {
            if((masca==(1<<n)-1) and y.node==0)
                minim=min(minim,dp[x][masca]+y.cost);
            int fakemasca=(masca|(1<<y.node));
            if(masca!=fakemasca and dp[x][masca]+y.cost<dp[y.node][fakemasca])
            {
                dp[y.node][fakemasca]=dp[x][masca]+y.cost;
                if(inque[y.node][fakemasca]==0)
                    q.push({y.node,fakemasca});
            }
        }
    }
}

int32_t main()
{
    f>>n>>m;
    for(int i=1; i<=m; i++)
        f>>x>>y>>z, edges[x].push_back({y,z});
    for(int i=0; i<=n; i++)
        for(int j=1; j<(1<<n); j++)
            dp[i][j]=INT_MAX;
    dp[0][1]=0, dfs(0,1);
    if(minim==INT_MAX)
        g<<"Nu exista solutie";
    else
        g<<minim<<'\n';
    return 0;
}