#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <math.h>
#define rep(i,st,ed) for (int i=st;i<=ed;++i)
#define lb(x) (x&-x)
#define get(x) ((int)log2(x))

const int INF=0x3f3f3f3f;
const int N=66666;

int f[17][N],sum[N];
int v[17][17];

int read() {
	int x=0,v=1; char ch=getchar();
	for (;ch<'0'||ch>'9';v=(ch=='-')?(-1):v,ch=getchar());
	for (;ch<='9'&&ch>='0';x=x*10+ch-'0',ch=getchar());
	return x*v;
}

void upd(int &x,int v) {
	(x<v)?(x=v):0;
}

int main(void) {
	int n=read(),m=read();
	int prt=0;
	rep(i,1,m) {
		int x=read()-1,y=read()-1;
		v[x][y]=v[y][x]=read(),prt+=v[x][y];
	}
	for (int S=1;S<(1<<n);++S) {
		int x=get(lb(S));
		sum[S]=sum[S-(1<<x)];
		rep(i,0,n-1) if (v[i][x]&&(S>>i&1)) {
			sum[S]+=v[i][x];
		}
	}
	rep(i,0,n-1) for (int S=0;S<(1<<n);++S) f[i][S]=-INF;
	int ans=0; f[0][1]=0;
	for (int S=1;S<(1<<n);++S) {
		if (!(S&1)) continue;
		rep(i,0,n-1) {
			if (!((S>>i))&1) continue;
			for (int T=S;T;T=(T-1)&S) {
				if (T>>i&1) upd(f[i][S],f[i][S-T+(1<<i)]+sum[T]);
			}
			for (int T=(1<<n)-1-S,j;T;T-=lb(T)) {
				j=get(lb(T));
				if (v[i][j]) upd(f[j][S+(1<<j)],f[i][S]+v[i][j]);
			}
		}
		if (S>>(n-1)&1) upd(ans,f[n-1][S]);
	}
	printf("%d\n", prt-ans);
	return 0;
}
#include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN=2010;
const int MOD=1e9+7;
int n,k;
long long fac[MAXN*MAXN],inv[MAXN*MAXN],f[MAXN][MAXN];
long long C(long long x,long long y)
{
	return fac[x]*inv[y]%MOD*inv[x-y]%MOD;
}
long long qpow(long long x,long long y)
{
	long long tmp=1;
	for(;y;y>>=1,x=x*x%MOD)if(y&1)tmp=tmp*x%MOD;
	return tmp;
}
int main()
{
//	freopen("test.in","r",stdin);
//	freopen("test.out","w",stdout);
	scanf("%d%d",&n,&k);
	if(k==1)
	{
		printf("1");
		return 0;
	}
	fac[0]=1;
	for(int i=1;i<=n*k;i++)fac[i]=fac[i-1]*i%MOD;
	inv[n*k]=qpow(fac[n*k],MOD-2);
	for(int i=n*k;i>=1;i--)inv[i-1]=inv[i]*i%MOD;
	f[0][0]=1;
	for(int i=1;i<=n;i++)
		for(int j=0;j<=i;j++)
		{
			f[i][j]=f[i-1][j];
			if(!j)continue;
			f[i][j]=(f[i][j]+f[i][j-1]*(n-j+1)%MOD*C(n-i+(n-j+1)*(k-1)-1,k-2))%MOD;
		}
	printf("%lld\n",f[n][n]);
	return 0;
}
