Problem: Mole decided to live in an abandoned mine. The structure of the mine is represented by a simple connected undirected graph which consists of N vertices numbered 1 through N and M edges. The i-th edge connects Vertices a_i and b_i, and it costs c_i yen (the currency of Japan) to remove it.

Mole would like to remove some of the edges so that there is exactly one path from Vertex 1 to Vertex N that does not visit the same vertex more than once. Find the minimum budget needed to achieve this.

Constraints

* 2 \leq N \leq 15
* N-1 \leq M \leq N(N-1)/2
* 1 \leq a_i, b_i \leq N
* 1 \leq c_i \leq 10^{6}
* There are neither multiple edges nor self-loops in the given graph.
* The given graph is connected.

Input

Input is given from Standard Input in the following format:


N M
a_1 b_1 c_1
:
a_M b_M c_M


Output

Print the answer.

Examples

Input

4 6
1 2 100
3 1 100
2 4 100
4 3 100
1 4 100
3 2 100


Output

200


Input

2 1
1 2 1


Output

0


Input

15 22
8 13 33418
14 15 55849
7 10 15207
4 6 64328
6 9 86902
15 7 46978
8 14 53526
1 2 8720
14 12 37748
8 3 61543
6 5 32425
4 11 20932
3 12 55123
8 2 45333
9 12 77796
3 9 71922
12 15 70793
2 4 25485
11 6 1436
2 7 81563
7 11 97843
3 1 40491


Output

133677

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;


class Main {
    static final long I=1L<<48;
    public static void main(String[] args) {
        MyScanner sc = new MyScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out));
        int n=sc.nextInt();
        int m=sc.nextInt();
        long[][]cost=new long[n][n];
        for(int i=0;i<n;++i)
            Arrays.fill(cost[i],0);
        long ctotal=0;
        for(int i=0;i<m;++i){
            int a=sc.nextInt()-1;
            int b=sc.nextInt()-1;
            int c=sc.nextInt();
            cost[a][b]=c;
            cost[b][a]=c;
            ctotal+=c;
        }
        long[]ext=new long[1<<n];
        ext[0]=-I;
        for(int b=1;b<1<<n;++b){
            long t=0;
            for(int i=0;i<n;++i)
                if((b&1<<i)!=0)
                    for(int j=0;j<i;++j)
                        if((b&1<<j)!=0)
                            t+=cost[i][j];
            ext[b]=t;
        }
        //System.err.println(Arrays.toString(ext));
        long[][]dp=new long[n][1<<n];
        long[][]dpnxt=new long[n][1<<n];
        for(int i=0;i<n;++i)
            Arrays.fill(dp[i],-I);
        for(int i=0;i<n;++i)
            Arrays.fill(dpnxt[i],-I);
        dpnxt[0][0]=0;
        for(int b=1;b<1<<n;++b)
            for(int i=0;i<n;++i){
                long ma=-I;
                if((b&1<<i)==0)continue;
                int s=b^1<<i;
                while(true){
                    ma=Math.max(ma,dpnxt[i][s]+ext[b^s]);
                    if(s==0)break;
                    s=(s-1)&(b^1<<i);
                }
                //System.err.println("dp["+i+"]["+b+"]="+ma);
                dp[i][b]=ma;
                for(int j=0;j<n;++j){
                    if((b&1<<j)==0&&cost[i][j]>0)
                        dpnxt[j][b]=Math.max(dpnxt[j][b],ma+cost[i][j]);
                }
            }
        out.println(ctotal-dp[n-1][(1<<n)-1]);
        out.close();
    }
    // http://codeforces.com/blog/entry/7018
    //-----------PrintWriter for faster output---------------------------------
    public static PrintWriter out;
    //-----------MyScanner class for faster input----------
    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;
        public MyScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }
        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
        int nextInt() {
            return Integer.parseInt(next());
        }
        long nextLong() {
            return Long.parseLong(next());
        }
        double nextDouble() {
            return Double.parseDouble(next());
        }
        String nextLine(){
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}