#include <bits/stdc++.h>
using namespace std;
namespace std {
template <class S, class T>
struct hash<pair<S, T>> {
  size_t operator()(const pair<S, T> &p) const {
    return ((size_t)1e9 + 7) * hash<S>()(p.first) + hash<T>()(p.second);
  }
};
template <class T>
struct hash<vector<T>> {
  size_t operator()(const vector<T> &v) const {
    size_t h = 0;
    for (auto i : v) h = h * ((size_t)1e9 + 7) + hash<T>()(i) + 1;
    return h;
  }
};
}  // namespace std
template <class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "[ ";
  for (int i = 0; i < (int)v.size(); i++)
    os << v[i] << (i == v.size() - 1 ? " ]" : ", ");
  return os;
}
template <class T>
ostream &operator<<(ostream &os, const set<T> &v) {
  os << "{ ";
  for (const auto &i : v) os << i << ", ";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &v) {
  os << "{";
  for (const auto &i : v) os << " " << i.first << ": " << i.second << ",";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
void dbgprint(const string &fmt) { cerr << endl; }
template <class H, class... T>
void dbgprint(const string &fmt, const H &h, const T &...r) {
  cerr << fmt.substr(0, fmt.find(",")) << "= " << h << " ";
  dbgprint(fmt.substr(fmt.find(",") + 1), r...);
}
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;
int n, m;
int dp[1 << 15], msp[1 << 15];
int p[15];
int root(int x) {
  if (x == p[x]) return x;
  return p[x] = root(p[x]);
}
int calc_msp(const vector<tuple<int, int, int>> &es, int bit) {
  int res = 0;
  for (int i = 0; i < (int)n; i++) p[i] = i;
  for (int i = es.size() - 1; i >= 0; i--) {
    int a, b, c;
    tie(c, a, b) = es[i];
    if (!(bit & 1 << a) || !(bit & 1 << b)) continue;
    res += c;
    a = root(a);
    b = root(b);
    if (a != b) {
      p[b] = a;
      res -= c;
    }
  }
  if (root(0) != root(n - 1)) return inf;
  return res;
}
int calc(const vector<tuple<int, int, int>> &es, int bit, int to) {
  int res = 0;
  for (const auto &e : es) {
    int a, b, c;
    tie(c, a, b) = e;
    if ((bit & 1 << a) && (bit & 1 << b)) continue;
    if (!(bit & 1 << a) && !(bit & 1 << b)) continue;
    if (a != to && b != to) res += c;
  }
  return res;
}
int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);
  cin >> n >> m;
  vector<tuple<int, int, int>> es;
  for (int i = 0; i < (int)m; i++) {
    int a, b, c;
    cin >> a >> b >> c;
    a--;
    b--;
    es.emplace_back(c, a, b);
  }
  sort((es).begin(), (es).end());
  for (int i = 0; i < (int)1 << n; i++) {
    dp[i] = msp[i] = inf;
    if ((i & 1 << 0) && (i & 1 << n - 1)) msp[i] = calc_msp(es, i);
    for (int j = 0; j < (int)n; j++)
      if (!(i & 1 << j)) dp[i] = min(dp[i], calc(es, i, j));
  }
  int ans = inf;
  for (int i = 0; i < (int)1 << n; i++)
    for (int j = i; j; j = j - 1 & i) dp[i] = min(dp[i], dp[j] + dp[i - j]);
  for (int i = 0; i < (int)1 << n; i++)
    ans = min(ans, msp[i] + dp[(1 << n) - 1 ^ i]);
  cout << ans << endl;
  return 0;
}
