送你一朵圣诞树

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#define fo(i,a,b) for(i=a;i<=b;i++)
#define db double
#define max(x,y) ((x)>(y)?(x):(y))
#define ll long long
using namespace std;

const int maxn=30005;

struct P{
    ll tp,t,s,an;
    db z;
    bool operator < (const P &b) const{
        return z>b.z;
    }
}tmp,cc,ss[maxn],cp[maxn];
int de[maxn],fa[maxn],w[maxn],r[maxn];
int fi[maxn],ne[maxn*2],dui[maxn*2],qc[maxn],f[maxn];
bool bz[maxn];
int i,j,k,l,m,n,x,y,now,sj;
ll ans;
priority_queue <P> cs;

void add(int x,int y){
    if (fi[x]==0) fi[x]=++now; else ne[qc[x]]=++now;
    qc[x]=now; dui[now]=y;
}
void dfs(int x){
    for(int i=fi[x];i;i=ne[i]){
        if (de[dui[i]]) continue;
        de[dui[i]]=de[x]+1; f[dui[i]]=x;
        dfs(dui[i]);
    }
}
int getfather(int x){
    if (fa[x]==x) return x; else fa[x]=getfather(fa[x]);
    return fa[x];
}
void get_an(){
    int i;
    fo(i,1,n) fa[i]=i;
    memset(bz,false,sizeof(bz)); bz[sj]=true;
    i=1;
    while (i<n){
        cc=cs.top();
        if (bz[cc.tp]){
            cs.pop();continue;
        }
        i++; bz[cc.tp]=true;
        x=getfather(f[cc.tp]);
        fa[cc.tp]=x;
        cp[x].an=cp[cc.tp].an+cp[x].an+cp[cc.tp].s*cp[x].t;
        cp[x].t+=cp[cc.tp].t; cp[x].s+=cp[cc.tp].s;
        cp[x].z=1.0*cp[x].s/cp[x].t;
        cs.pop();
        cs.push(cp[x]);
    }
    ans=max(ans,cp[sj].an);
}
int main(){
    freopen("xmastree2.in","r",stdin);
    freopen("xmastree2.out","w",stdout);
    scanf("%d",&n);
    fo(i,1,n-1){
        scanf("%d%d",&x,&y); add(x,y); add(y,x);
    }
    fo(i,1,n){
        scanf("%d%d",&w[i],&r[i]);
        ss[i].t=1; ss[i].s=w[i]; ss[i].an=w[i]; ss[i].z=w[i]; ss[i].tp=i;
    }
    fo(i,1,n) if (r[i]){
        memset(de,0,sizeof(de)); de[i]=1; dfs(i); f[i]=0;
        while (! cs.empty()) cs.pop();
        fo(j,1,n) cs.push(ss[j]);
        memcpy(cp,ss,sizeof(cp)); sj=i;
        get_an();
    }
    printf("%lld\n",ans);
    return 0;
}