#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define all(v) begin(v), end(v)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 2000000000
#define int long long int

#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )
#define LE(n, m) ((n) < (m) + EPS)
#define LEQ(n, m) ((n) <= (m) + EPS)
#define GE(n, m) ((n) + EPS > (m))
#define GEQ(n, m) ((n) + EPS >= (m))

typedef vector<int> VI;
typedef vector<VI> MAT;
typedef pair<int, int> pii;
typedef long long ll;

typedef complex<double> P;
typedef pair<P, P> L;
typedef pair<P, double> C;

int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
int const MOD = 1000000007;
ll mod_pow(ll x, ll n) {return (!n)?1:(mod_pow((x*x)%MOD,n/2)*((n&1)?x:1))%MOD;}
int madd(int a, int b) {return (a + b) % MOD;}
int msub(int a, int b) {return (a - b + MOD) % MOD;}
int mmul(int a, int b) {return (a * b) % MOD;}
int minv(int a) {return mod_pow(a, MOD-2);}
int mdiv(int a, int b) {return mmul(a, minv(b));}

namespace std {
    bool operator<(const P& a, const P& b) {
        return a.X != b.X ? a.X < b.X : a.Y < b.Y;
    }
}

int V, E;
int dist[20][20];
int bitdp[1 << 15];
int deg[20];
signed main() {
    cin >> V >> E;
    memset(deg, 0, sizeof(deg));
    rep(i,0,V) rep(j,0,V) {
        if(i != j) dist[i][j] = INF;
        else dist[i][j] = 0;
    }

    int sum = 0;
    rep(i,0,E) {
        int s, t, d; cin >> s >> t >> d;
        sum += d;
        dist[s][t] = min(dist[s][t], d);
        dist[t][s] = min(dist[t][s], d);
        deg[s]++; deg[t]++;
    }
    rep(k,0,V) rep(i,0,V) rep(j,0,V) {
        dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
    }
    vector<int> oddvertices;
    rep(i,0,V) if(deg[i] % 2) oddvertices.pb(i);
    int n = (int)oddvertices.size();
    rep(i,0,1<<n) bitdp[i] = INF;
    bitdp[0] = 0;
    rep(bit,0,1<<n) {
        rep(i,0,n) rep(j,i+1,n) {
            if(bit >> i & 1) continue;
            if(bit >> j & 1) continue;
            int nbit = bit | (1 << i) | (1 << j);
            int x = oddvertices[i];
            int y = oddvertices[j];
            bitdp[nbit] = min(bitdp[nbit], bitdp[bit] + dist[x][y]);
        }
    }
    cout << sum + bitdp[(1 << n) - 1] << endl;
    return 0;
}