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

using uint=unsigned;
using ll=long long;
using ull=unsigned long long;
#define int ll

#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) FOR(i,0,b)
#define ROF(i,a,b) for(int i=int(b)-1;i>=a;i--)
#define per(i,b) ROF(i,0,b)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(),x.end()
auto& errStream=cerr;
#ifdef LOCAL
#define cerr (cerr<<"-- line "<<__LINE__<<" -- ")
#else
class CerrDummy{}cerrDummy;
template<class T>
CerrDummy& operator<<(CerrDummy&cd,const T&){
	return cd;
}
using charTDummy=char;
using traitsDummy=char_traits<charTDummy>;
CerrDummy& operator<<(CerrDummy&cd,basic_ostream<charTDummy,traitsDummy>&(basic_ostream<charTDummy,traitsDummy>&)){
	return cd;
}
#define cerr cerrDummy
#endif
#define reach cerr<<"reached"<<endl
void dmpr(decltype(cerr)&os){os<<endl;}
template<class T,class... Args>
void dmpr(decltype(cerr)&os,const T&t,const Args&... args){
	os<<t<<" ";
	dmpr(os,args...);
}
#define dmp(...) dmpr(cerr,##__VA_ARGS__)
#define zero(x) memset(x,0,sizeof(x))
#define one(x) memset(x,-1,sizeof(x))
#define fs first
#define sc second
#define bg begin()
#define ed end()

template<class T> using V=vector<T>;
template<class T> using VV=V<V<T>>;

using pi=pair<int,int>;
using vi=vector<int>;
using ld=long double;

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,(int)v.size()){
		if(i)os<<",";
		os<<v[i];
	}
	os<<"}";
	return os;
}

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"(";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<")";
}

ll read(){
	ll i;
	scanf("%lld",&i);
	return i;
}

void printSpace(){
	printf(" ");
}

void printEoln(){
	printf("\n");
}

void print(ll x,int suc=1){
	printf("%lld",x);
	if(suc==1)
		printEoln();
	if(suc==2)
		printSpace();
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

template<class T>
void print(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print(v[i],i==int(v.size())-1?suc:2);
}

string readString(){
	static char buf[3341000];
	scanf("%s",buf);
	return string(buf);
}

char* readCharArray(){
	static char buf[3341000];
	static int bufUsed=0;
	char* ret=buf+bufUsed;
	scanf("%s",ret);
	bufUsed+=strlen(ret)+1;
	return ret;
}

template<class T,class U>
void chmax(T& a,U b){
	if(a<b)
		a=b;
}

template<class T,class U>
void chmin(T& a,U b){
	if(b<a)
		a=b;
}

template<class T>
T Sq(const T& t){
	return t*t;
}

#define CAPITAL
void Yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<endl;
	#else
	cout<<"Yes"<<endl;
	#endif
	if(ex)exit(0);
}
void No(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<endl;
	#else
	cout<<"No"<<endl;
	#endif
	if(ex)exit(0);
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

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

template<class T>
vector<T> uni(const vector<T>&vv){
	auto v(vv);
	sort(all(v));
	v.erase(unique(all(v)),v.end());
	return v;
}
template<class T>
void mkuni(vector<T>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.end());
}

int topbit(signed t){
	return 31-__builtin_clz(t);
}
int topbit(ll t){
	return 63-__builtin_clzll(t);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(int(1)<<topbit(i))==i;
}

template<uint mod>
struct ModInt{
	static constexpr uint base=mod;
	uint v;
	ModInt():v(0){}
	ModInt(ll vv){
		v=(vv%mod+mod);
		if(v>=mod)v-=mod;
	}
	explicit operator bool()const{
		return v;
	}
	explicit operator int()const{
		return v;
	}
	bool operator==(const ModInt&rhs)const{
		return v==rhs.v;
	}
	bool operator!=(const ModInt&rhs)const{
		return v!=rhs.v;
	}
	ModInt operator-()const{
		return ModInt(0)-*this;
	}
	ModInt& operator+=(const ModInt&rhs){
		v+=rhs.v;
		if(v>=mod)v-=mod;
		return *this;
	}
	ModInt&operator-=(const ModInt&rhs){
		v+=mod-rhs.v;
		if(v>=mod)v-=mod;
		return *this;
	}
	ModInt&operator*=(const ModInt&rhs){
		v=ull(v)*rhs.v%mod;
		return *this;
	}
	ModInt&operator/=(const ModInt&rhs){
		operator*=(rhs.inv());
		return *this;
	}
	ModInt operator+(const ModInt&rhs)const{
		return ModInt(*this)+=rhs;
	}
	ModInt operator-(const ModInt&rhs)const{
		return ModInt(*this)-=rhs;
	}
	ModInt operator*(const ModInt&rhs)const{
		return ModInt(*this)*=rhs;
	}
	ModInt operator/(const ModInt&rhs)const{
		return ModInt(*this)/=rhs;
	}
	friend ModInt operator+(int x,const ModInt&y){
		return ModInt(x)+y;
	}
	friend ModInt operator-(int x,const ModInt&y){
		return ModInt(x)-y;
	}
	friend ModInt operator*(int x,const ModInt&y){
		return ModInt(x)*y;
	}
	friend ModInt operator/(int x,const ModInt&y){
		return ModInt(x)/y;
	}
	ModInt pow(int n)const{
		ModInt res(1),x(*this);
		while(n){
			if(n&1)res*=x;
			x*=x;
			n>>=1;
		}
		return res;
	}
	ModInt inv()const{
		return pow(mod-2);
	}
};

template<uint mod>
ostream& operator<<(ostream&os,const ModInt<mod>&m){
	return os<<m.v;
}
template<uint mod>
void print(const ModInt<mod>&m,int suc=1){
	print(m.v,suc);
}

using mint=ModInt<1000000007>;
//using mint=ModInt<998244353>;

const int Vmax=min<int>(2000010,mint::base);
mint fact[Vmax],factInv[Vmax],invs[Vmax];
void InitFact(){
	fact[0]=1;
	FOR(i,1,Vmax){
		fact[i]=fact[i-1]*i;
	}
	factInv[Vmax-1]=fact[Vmax-1].inv();
	for(int i=Vmax-2;i>=0;i--){
		factInv[i]=factInv[i+1]*(i+1);
	}
	for(int i=Vmax-1;i>=1;i--){
		invs[i]=factInv[i]*fact[i-1];
	}
}
struct InitFactDummy{
	InitFactDummy(){
		InitFact();
	}
} initFactDummy;
mint Choose(int n,int k){
	return fact[n]*factInv[n-k]*factInv[k];
}
mint Binom(int a,int b){
	return fact[a+b]*factInv[a]*factInv[b];
}
mint Catalan(int n){
	return Binom(n,n)-(n-1>=0?Binom(n-1,n+1):0);
}

const int Mmax=210;
mint bin[Mmax][Mmax];

const int Nmax=20;
V<pi> tr[Nmax];

bool dfs(int v,int p,int t,int&cur){
	if(v==t)return true;
	for(auto e:tr[v])if(e.fs!=p){
		cur^=1<<e.sc;
		if(dfs(e.fs,v,t,cur))return true;
		cur^=1<<e.sc;
	}
	return false;
}

int get(int s,int t){
	int res=0;
	dfs(s,-1,t,res);
	return res;
}

int cnt[1<<Nmax],cnt2[1<<Nmax];
mint dp[1<<Nmax][3];

signed main(){
	rep(i,Mmax)rep(j,Mmax)
		bin[i][j]=Binom(i,j)*fact[i];
	int n=read(),m=read();
	int un=0;
	rep(i,m){
		int a=read()-1,b=read()-1;
		if(i<n-1){
			tr[a].eb(b,i);
			tr[b].eb(a,i);
		}else{
			int w=get(a,b);
			cerr<<w<<endl;
			cnt[w]++;
			cnt2[w]+=popcount(w);
			un+=n-1-popcount(w);
		}
	}
	rep(i,n-1){
		rep(j,1<<(n-1)){
			if((j&(1<<i))==0){
				cnt[j^(1<<i)]+=cnt[j];
				cnt2[j^(1<<i)]+=cnt2[j];
			}
		}
	}
	dp[(1<<(n-1))-1][0]=1;
	ROF(j,1,1<<(n-1)){
		int p=popcount(j);
		rep(i,n-1)
			if(j&(1<<i)){
				int nx=j^(1<<i);
				int a=cnt[j]-cnt[nx];
				int b=m-p-cnt[j];
				dmp(j,nx,a,b);
				dp[nx][0]+=dp[j][0]*bin[a][b];
				dp[nx][1]+=dp[j][0]*bin[a+1][b];
				dp[nx][2]+=dp[j][0]*bin[a][b]*(p*a-(cnt2[j]-cnt2[nx]));
				dp[nx][1]+=dp[j][1]*bin[a][b+1];
				if(a)dp[nx][2]+=dp[j][1]*bin[a-1][b+1]*a;
				dp[nx][2]+=dp[j][2]*bin[a][b];
			}
	}
	dmp(dp[0][0],dp[0][2]);
	mint ans=dp[0][0]*(un+n*(n-1)/2)-dp[0][2];
	print(ans);
}


Measured memory_bytes: 49408