#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
#define chad char
#define mod 1000000007
#define dim 100005
#define lim 1000000
#define mdim 1501
#define mult 2e9
#define maxx 200002
#define simaimult 1e17
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define pli pair<ll,int>
#define pil pair<int,ll>
#define piii pair<int,pair<int,int> > 
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define mp make_pair
#define nr_biti __builtin_popcount
using namespace std;
 
ifstream fin("hamilton.in");
ofstream fout("hamilton.out");

int n,m;

vector<pii> g[30],gt[30];

bool viz[20][3*dim];
int dp[30][3*dim];
int dist[30];

int search(int nod,int mask)
{
    if(viz[nod][mask])
        return dp[nod][mask];

    viz[nod][mask]=1;

    if(mask==0)
    {
        dp[nod][mask]=0;
        return 0;
    }

    dp[nod][mask]=1e9;

    for(auto it:gt[nod])
    {
        if(mask&(1<<it.first))
        {
            dp[nod][mask]=min(dp[nod][mask],it.second+search(it.first,mask^(1<<it.first)));
        }
    }

    return dp[nod][mask];
}

int main()
{
    ios_base::sync_with_stdio(false);
    fin.tie(nullptr);
    fout.tie(nullptr); 

    fin >> n >> m;

    for(int i=1; i<=m; i++)
    {
        int x,y,w;

        fin >> x >> y >> w;

        g[x].pb(mp(y,w));
        gt[y].pb(mp(x,w));

        if(y==0)
        {
            if(dist[x]==0)
                dist[x]=w;
            else 
                dist[x]=min(dist[x],w);
        }
    }

    int ans=1e9;
    int masca=(1<<n)-1;

    for(int i=0; i<n; i++)
    {
        int cand=search(i,masca^(1<<i));

        if(cand==1e9 || dist[i]==0)
            continue;

        ans=min(ans,cand+dist[i]);
    }

    if(ans==1e9)
        fout << "Nu exista solutie";
    else 
        fout << ans;

    return 0;
}

/*

    considera acest mesaj de la rata de cauciuc a domnului matei venit de pe taramurile dragonilor 
    marelui (cocalar) sadoveanu <3

*/