#include <fstream>
#include <vector>
using namespace std;
ifstream cin("hamilton.in");
ofstream cout("hamilton.out");
const int mxn=20;
struct s{
    int nod,c;
};
vector<s>adj[mxn];
int d[(1<<19)][mxn];
int dist[mxn];
int main()
{
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        int a,b,c;
        cin>>a>>b>>c;
        adj[b].push_back({a,c});
        if(b==0) dist[a]=c;
    }
    for(int mask=0;mask<(1<<19);mask++){
        for(int i=0;i<n;i++){
            d[mask][i]=1e9;
        }
    }
    d[1][0]=0;
    for(int mask=1;mask<(1<<n);mask++){
        for(int i=0;i<n;i++){
            if(!((mask>>i)&1)) continue;
            for(auto e:adj[i]){
                int nod=e.nod,c=e.c;
                if(!((mask>>nod)&1)) continue;
                d[mask][i]=min(d[mask][i],d[mask-(1<<i)][nod]+c);
            }
        }
    }
    int ans=1e9;
    for(int i=1;i<n;i++){
        if(dist[i]) ans=min(ans,d[(1<<n)-1][i]+dist[i]);
    }
    cout<<ans;
    return 0;
}