#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(),(c).end()

#ifdef LOCAL
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else 
#define dump(x) true
#endif

constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

template<class T, class U> void chmin(T& t, const U& u) { if (t > u) t = u; }
template<class T, class U> void chmax(T& t, const U& u) { if (t < u) t = u; }

template<class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
	os<<"("<<p.first<<","<<p.second<<")";
	return os;
}

template<class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
	os<<"{";
	rep(i, v.size()) {
		if (i) os<<",";
		os<<v[i];
	}
	os<<"}";
	return os;
}

template <unsigned int MOD>
struct ModInt {
	using uint = unsigned int;
	using ull = unsigned long long;
	using M = ModInt;

	uint v;

	ModInt(ll _v = 0) { set_norm(_v % MOD + MOD); }
	M& set_norm(uint _v) { //[0, MOD * 2)->[0, MOD)
		v = (_v < MOD) ? _v : _v - MOD;
		return *this;
	}

	explicit operator bool() const { return v != 0; }
	M operator+(const M& a) const { return M().set_norm(v + a.v); }
	M operator-(const M& a) const { return M().set_norm(v + MOD - a.v); }
	M operator*(const M& a) const { return M().set_norm(ull(v) * a.v % MOD); }
	M operator/(const M& a) const { return *this * a.inv(); }
	M& operator+=(const M& a) { return *this = *this + a; }
	M& operator-=(const M& a) { return *this = *this - a; }
	M& operator*=(const M& a) { return *this = *this * a; }
	M& operator/=(const M& a) { return *this = *this / a; }
	M operator-() const { return M() - *this; }
	M& operator++(int) { return *this = *this + 1; }
	M& operator--(int) { return *this = *this - 1; }

	M pow(ll n) const {
		if (n < 0) return inv().pow(-n);
		M x = *this, res = 1;
		while (n) {
			if (n & 1) res *= x;
			x *= x;
			n >>= 1;
		}
		return res;
	}

	M inv() const {
		ll a = v, b = MOD, p = 1, q = 0, t;
		while (b != 0) {
			t = a / b;
			swap(a -= t * b, b);
			swap(p -= t * q, q);
		}
		return M(p);
	}

	bool operator==(const M& a) const { return v == a.v; }
	bool operator!=(const M& a) const { return v != a.v; }
	friend ostream& operator<<(ostream& os, const M& a) { return os << a.v; }
};

using Mint = ModInt<1000000007>;

const int maxv = 1000010;

Mint fact[maxv], finv[maxv], inv[maxv];

void init() {
    fact[0] = 1;
    for (int i = 1; i < maxv; ++i) {
        fact[i] = fact[i-1] * i;
    }

    finv[maxv-1] = fact[maxv-1].inv();
    for (int i = maxv - 2; i >= 0; --i) {
        finv[i] = finv[i+1] * (i+1);
    }

    for (int i = 1; i < maxv; ++i) {
        inv[i] = finv[i] * fact[i-1];
    }
}

Mint comb(int n, int r) {
    if (n < 0 || r < 0 || r > n) return Mint(0);
    return fact[n] * finv[r] * finv[n-r];
}

const int maxn = 20;

V<pii> g[maxn];
int sub[maxn];

void dfs(int v, int p, int cur) {
	sub[v] = cur;
	for (auto e : g[v]) if (e.fi != p) {
		dfs(e.fi, v, cur | (1 << e.se));
	}
}

int main() {
	int N, M; cin >> N >> M;
	V<pii> es;

	rep(i, M) {
		int a, b; cin >> a >> b; --a; --b;

		if (i < N-1) {
			g[a].eb(b, i);
			g[b].eb(a, i);
		}
		es.eb(a, b);
	}

	V<int> cnt(1 << (N-1));

	for (int i = N-1; i < M; ++i) {
		dfs(es[i].fi, -1, 0);
		++cnt[sub[es[i].se]];
	}

	int ne = N-1;
	rep(i, ne) {
		rep(j, 1 << ne) if ((j >> i) & 1) {
			cnt[j] += cnt[j ^ (1 << i)];
		}
	}

	init();

	dump(cnt);

	V<Mint> way(1 << ne), sum(1 << ne);
	//add tree edges from the larger cost

	way[0] = 1;

	rep(i, 1 << ne) {
		rep(j, ne) if ((i >> j) & 1) {
			//left

			int use = (1 << ne) - 1 - i;
			int num = __builtin_popcount(i) - 1; 
			int all = M - (N-1) - cnt[use | (1 << j)] + num;
			int inc = cnt[use | (1 << j)] - cnt[use];
			//(i ^ (1 << j)) -> i
			//add inc others and 1 tree edge

			Mint curway = way[i ^ (1 << j)] * fact[all + inc] * finv[all];
			Mint cursum = sum[i ^ (1 << j)] * fact[all + inc + 1] * finv[all + 1];

			cursum += curway * (num + 1);
			way[i] += curway;
			sum[i] += cursum;
		}
	}
	dump(way);
	dump(sum);
	cout << sum.back() << endl;

	return 0;
}

Measured memory_bytes: 18176