CF123E Maze(数学期望，dfs求子树和)

题意：给你一个n-1个结点的树，给出每个点作为入口和出口的概率。求从入口走到出口的期望步数。
分析：当考虑一个点为入口，其他点如果在出口之前被dfs过，则出现2次，否则出现1次，当出口确定，一个点在之前被访问的概率是1/2(类似于插空，可以往前插，可以往后插)。现在考虑一个点为出口(它的概率是chu[u])，先dfs出子树中结点的个数和以子树中结点为入口的概率，这个子树对期望的贡献就是$sz[i]\ast sumpro[i]\ast chu[u]$,同样的子树外的点的贡献是$(n-sz[u])\ast (1.0-su{m}_{p}ro[u])\ast chu[u]$，，，，，，万年老套路树上结点分类算贡献。

#include<bits/stdc++.h>
#define f(i,a,b) for( int i=a;i<=b;++i)
#define ff(i,a,b) for( int i=a;i>=b;--i)
#define debug(x) cerr << #x << " : " << x << " " << endl
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<string, string> pss;
const ll mod = 1e9 + 7;
const ll mod2 = 998244353;
const int inf = 0x3f3f3f3f;
const double tiaohe = 0.57721566490153286060651209;
ll oula(ll x) { ll res = x;f(i, 2, x / i) { if (x % i == 0) { res = res / i * (i - 1);while (x % i == 0) x /= i; } }if (x > 1) res = res / x * (x - 1);return res; }
ll quickmod(ll a, ll n, ll m) { ll s = 1;while (n) { if (n & 1) { s = s * a % m; }a = (a*a) % m;n = n / 2; }return s; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
void ex_gcd(ll a, ll b, ll &x, ll &y, ll &d) { if (!b) { d = a, x = 1, y = 0; } else { ex_gcd(b, a % b, y, x, d);y -= x * (a / b); } }
ll inv(ll t, ll p) { ll d, x, y;ex_gcd(t, p, x, y, d);return d == 1 ? (x % p + p) % p : -1; }
bool isPrime(ll x) { if (x == 2)return true;if (x % 2 == 0)return false;for (ll i = 2;i*i <= x;i++) if (x % i == 0)return false; return true; }
inline int in() { char ch = getchar();int x = 0, f = 1;while (ch<'0' || ch>'9') { if (ch == '-')f = -1;ch = getchar(); }while (ch >= '0'&&ch <= '9') { x = x * 10 + ch - '0';ch = getchar(); }return x * f; }
//double a = log(n) +tiaohe + 1.0 / (2 * n);
double eqa = (1 + sqrt(5.0)) / 2.0;
const double eps = 1e-6;
const int N = 3e5 + 5;
vector<int> G[N];
double chu[N], ru[N];
int sz[N],n;
double sum_pro[N],ans;
void dfs(int u, int fa)
{
	sz[u] = 1;
	sum_pro[u] = ru[u];
	for (auto i : G[u])
	{
		if (i == fa)continue;
		dfs(i, u);
		sz[u] += sz[i];
		sum_pro[u] += sum_pro[i];
		ans += chu[u] * sum_pro[i] * sz[i];
	}
	ans += (n - sz[u])*(1.0 - sum_pro[u])*chu[u];
	return;
}
int main()
{
	//freopen("in.txt", "r", stdin);
	n = in();
	f(i, 1, n - 1)
	{
		int x = in();
		int y = in();
		G[x].emplace_back(y);
		G[y].emplace_back(x);
	}
	double sum_chu = 0, sum_ru = 0;
	f(i, 1, n)
	{
		scanf("%lf%lf", &ru[i], &chu[i]);
		sum_ru += ru[i];
		sum_chu += chu[i];
	}
	f(i, 1, n)
	{
		ru[i] = ru[i] / sum_ru;
		chu[i] = chu[i] / sum_chu;
	}
	ans = 0;
	dfs(1, -1);
	printf("%.10lf\n", ans);
	return 0;
}