传送门
思路:
傻子题。
直接容斥+矩阵树定理算即可。。。
代码:
#include<bits/stdc++.h>
#define ri register int
#define fi first
#define se second
using namespace std;
const int rlen=1<<18|1;
inline char gc(){
static char buf[rlen],*ib,*ob;
(ib==ob)&&(ob=(ib=buf)+fread(buf,1,rlen,stdin));
return ib==ob?-1:*ib++;
}
inline int read(){
int ans=0;
char ch=gc();
while(!isdigit(ch))ch=gc();
while(isdigit(ch))ans=((ans<<2)+ans<<1)+(ch^48),ch=gc();
return ans;
}
typedef long long ll;
const int mod=1e9+7;
inline int add(const int&a,const int&b){return a+b>=mod?a+b-mod:a+b;}
inline int dec(const int&a,const int&b){return a>=b?a-b:a-b+mod;}
inline int mul(const int&a,const int&b){return (ll)a*b%mod;}
inline void Add(int&a,const int&b){a=a+b>=mod?a+b-mod:a+b;}
inline void Dec(int&a,const int&b){a=a>=b?a-b:a-b+mod;}
inline void Mul(int&a,const int&b){a=(ll)a*b%mod;}
const int N=17;
int n,a[N][N],cnt[1<<N];
inline int gauss(int n){
int ret=1;
for(ri t,i=1;i<=n;++i){
for(ri j=i+1;j<=n;++j){
while(a[j][i]){
t=a[i][i]/a[j][i];
for(ri k=i;k<=n;++k)Dec(a[i][k],mul(a[j][k],t));
swap(a[i],a[j]);
ret=mod-ret;
}
}
Mul(ret,a[i][i]);
}
return ret;
}
typedef pair<int,int> pii;
vector<pii>e[N];
inline int solve(int sta){
for(ri i=1;i<=n;++i)for(ri j=1;j<=n;++j)a[i][j]=0;
for(ri i=1;i<n;++i){
if(sta>>(i-1)&1)continue;
for(ri j=0,u,v;j<e[i].size();++j){
u=e[i][j].fi,v=e[i][j].se;
Dec(a[u][v],1),Dec(a[v][u],1);
Add(a[u][u],1),Add(a[v][v],1);
}
}
return gauss(n-1);
}
int main(){
n=read();
for(ri i=1;i<n;++i)for(ri tt=read();tt;--tt)e[i].push_back(pii(read(),read()));
int ans=0;
for(ri i=0,up=(1<<(n-1))-1;i<up;++i){
cnt[i]=i?cnt[i^(i&-i)]+1:0;
cnt[i]&1?Dec(ans,solve(i)):Add(ans,solve(i));
}
cout<<ans;
return 0;
}