#include<iostream>
#include<vector>
using namespace std;
static const int INF = 1 << 20;

int main(){
	int V, E;
	cin >> V >> E;
	vector<vector<int> > adj(V, vector<int>(V, INF));
	vector<int> cnt(V, 0);
	for(int i = 0; i < V; i++) adj[i][i] = 0;
	int sum = 0;
	for(int i = 0; i < E; i++){
		int s, t, d;
		cin >> s >> t >> d;
		adj[s][t] = min(adj[s][t], d);
		adj[t][s] = min(adj[t][s], d);
		cnt[s]++;
		cnt[t]++;
		sum += d;
	}
	for(int k = 0; k < V; k++){
		for(int i = 0; i < V; i++){
			for(int j = 0; j < V; j++){
				adj[i][j] = min(adj[i][j], adj[i][k] + adj[k][j]);
			}
		}
	}
	vector<int> v;
	for(int i = 0; i < V; i++){
		if(cnt[i] % 2 == 1) v.push_back(i);
	}
	int n = v.size();
	vector<int> memo(1 << n, INF);
	for(int i = 0; i < (1 << n); i++){
		if(i == 0){
			memo[i] = 0;
			continue;
		}
		for(int j = 0; j < n; j++){
			if(!(i & (1 << j))) continue;
			for(int k = 0; k < n; k++){
				if(k == j) continue;
				if(!(i & (1 << k))) continue;
				memo[i] = min(memo[i], memo[i - (1 << j) - (1 << k)] + adj[v[j]][v[k]]);
			}
		}
	}
	cout << sum + memo[(1 << n) - 1] << endl;
	return 0;
}

