#include <bits/stdc++.h>

using namespace std;

vector<int> L[20];
bool v[20];
int d[20][20];
//int ord[20];

int mn = 20000000;
int INI, n;
int s;
void dfs(int in, int k) {
    //ord[k] = in;
    if(k == n) {
        int inPlus = 0;
        bool ok = false;
        for(int i = 0; i < L[in].size() && !ok; i ++) {
            if(L[in][i] == INI)
                ok = true, inPlus = d[in][L[in][i]];
        }
        if(ok) {
            s += inPlus;
            mn = min(mn, s);
            s -= inPlus;
            /*for(int i = 1; i <= n; i ++) {
                cout << ord[i] << " ";
            }
            cout << INI << "\n";
            */
        }
    }
    else {
        //ord[k] = in;
        for(int i = 0; i < L[in].size(); i ++) {
            if(!v[L[in][i]]) {
                v[L[in][i]] = true;
                s += d[in][L[in][i]];
                dfs(L[in][i], k + 1);
                v[L[in][i]] = false;
                s -= d[in][L[in][i]];
            }
        }
    }
}
int main()
{
    freopen("hamilton.in", "r", stdin);
    freopen("hamilton.out", "w", stdout);

    int m, x, y, c;
    cin >> n >> m;
    for(int i = 1; i <= m; i ++) {
        cin >> x >> y >> c;
        L[x].push_back(y);
        d[x][y] = c;
    }

    for(int i = 0; i < n; i ++) {
        INI = i;
        v[i] = true;
        dfs(i, 1);
        v[i] = false;
    }
    cout << mn << "\n";
    return 0;
}