https://nanti.jisuanke.com/t/41392
dp[i] 表示节点i到端点失败的概率;
反思:概率不会算,就是每个子节点都会随机选择,所以做size次决策,所以时size的次方;
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
template<typename T>inline void read(T &x)
{
x=0;
static int p;p=1;
static char c;c=getchar();
while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
x*=p;
}
//-----------------------------------------------
const int maxn=1e6+9;
const int maxm=5e6+9;
const int mod=1e9+7;
struct E
{
int to,nex;
}edge[maxn<<2];
int head[maxn];
int tot;
ll dp[maxn];
int deep[maxn];
int maxd=0;
void init()
{
tot=0;
maxd=0;
mem(deep,0);
mem(dp,0);
mem(head,-1);
}
void addedge(int u,int v)
{
edge[tot].to=v;
edge[tot].nex=head[u];
head[u]=tot++;
}
ll ksm(ll a,ll b)
{
ll ans=1;
while(b)
{
if(b&1) ans=ans*a%mod;
a=a*a%mod;
b>>=1;
}
return ans;
}
int n;
ll inv(ll x)
{
return ksm(x,mod-2);
}
void dfs1(int u,int d,int fa)
{
deep[u]=d;
maxd=max(maxd,deep[u]);
for(int i=head[u];i!=-1;i=edge[i].nex)
{
int v=edge[i].to;
if(v==fa) continue;
dfs1(v,d+1,u);
}
}
void dfs2(int u,int fa)
{
ll si=0;
ll sum=0;
for(int i=head[u];i!=-1;i=edge[i].nex)
{
int v=edge[i].to;
if(v==fa) continue;
dfs2(v,u);
si++;
sum+=dp[v];
}
if(si==0)
{
if(deep[u]==maxd) dp[u]=0;
else dp[u]=1;
}
else
{
dp[u]=ksm(sum*inv(si)%mod,si);
}
}
int main()
{
FAST_IO;
init();
cin>>n;
for(int i=0;i<n-1;i++)
{
int u,v;
cin>>u>>v;
addedge(u,v);
addedge(v,u);
}
dfs1(1,1,-1);
dfs2(1,-1);
cout<<((1-dp[1])%mod+mod)%mod<<endl;
return 0;
}