#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
#include<cassert>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const long double eps = 1E-14;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

/////////////////////////////////////
struct unionfind {
	ll N;
	vector<ll> par;
	vector<ll> sz;//根の場合、その木のサイズ

	unionfind(ll N0) {
		N = N0;
		par.assign(N + 1, -1);
		sz.assign(N + 1, 1);

	}

	ll root(ll x) {
		if (par[x] == -1) { return x; }
		par[x] = root(par[x]);
		return par[x];
	}

	bool same(ll x, ll y) {
		return root(x) == root(y);
	}

	void unite(ll x, ll y) {
		ll a = root(x);
		ll b = root(y);
		if (a != b) {
			par[a] = b; sz[b] += sz[a];
		}

	}

	ll size(ll x) {
		ll r = root(x);
		return sz[r];
	}
};

int main(){
	ll N, M;
	cin >> N >> M;
	vector<pair<ll, ll>> e(M);
	rep(i, M)cin >> e[i].first >> e[i].second;

	vector<vector<pair<ll,ll>>> g(N + 1);
	vector <vector<bool>> mat(N + 1, vector<bool>(N + 1, 0));
	rep(i, N-1) {
		g[e[i].first].push_back({ i,e[i].second });
		g[e[i].second].push_back({ i,e[i].first });
	}
	rep(i,M){
		mat[e[i].first][e[i].second] = 1;
		mat[e[i].second][e[i].first] = 1;
	}

	vector<int> c(1 << (N - 1), 0);

	rep(i, 1 << (N - 1)) {

		vvll lis(N + 1);
		vll see(N + 1, 0);

		repn(v, N) {
			//cout << v << endl;
			if (see[v] != 0) { continue; }
			lis[v].push_back(v);
			see[v] = 1;
			queue<ll> q;
			q.push(v);

			while (!q.empty()) {
				ll w = q.front();
				q.pop();
				for (auto p : g[w]) {
					if (see[p.second] != 0) { continue; }
					if (!((i >> p.first) & 1)) { continue; }
					see[p.second] = 1;
					lis[v].push_back(p.second);
					q.push(p.second);
				}
			}
		}

		
		repn(j, N) {
			rep(k, lis[j].size())for (ll l = k + 1; l < lis[j].size(); l++) {
				if (mat[lis[j][k]][lis[j][l]]) { c[i]++; }
			}
		}

		//cout << i << " " << c[i] << endl;
	}

	//return 0;

	vector<vector<ll>> dp1(1 << (N - 1)), dp2(1 << (N - 1));

	dp1[0].push_back(1);
	dp2[0].push_back(0);

	repn(i, (1 << (N - 1))-1) {
		//cout << i << endl;

		dp1[i].assign(c[i]+1, 0);
		dp2[i].assign(c[i]+1, 0);
		
		rep(k, N - 1) {
			if (!((i >> k) & 1)) { continue; }

			ll x = i ^ (1 << k);
			repn(j, c[x]+1) {
				dp1[i][j] += dp1[x][j - 1];
				dp2[i][j] += dp2[x][j - 1] + dp1[x][j - 1] * j;
				dp1[i][j] %= MOD;
				dp2[i][j] %= MOD;
			}
		}

		repn(j, c[i]) {
			dp1[i][j] += dp1[i][j - 1] * (c[i] - (j - 1));
			dp2[i][j] += dp2[i][j - 1] * (c[i] - (j - 1));
			dp1[i][j] %= MOD;
			dp2[i][j] %= MOD;
		}
		
		//repn(j, c[i])cout << i << j << dp1[i][j] << dp2[i][j] << endl;
	}

	cout << dp2[(1 << (N - 1)) - 1][M] << endl;
}


Measured memory_bytes: 478464