bzoj3566

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
inline int read()
{
	int x=0;bool f=0;char c=getchar();
	for (;c<'0'||c>'9';c=getchar()) f=c=='-'?1:0;
	for (;c>='0'&&c<='9';c=getchar()) x=x*10+c-'0';
	return f?-x:x;
}
const int N=500005;
int n,ll=1,to[N<<1],next[N<<1],head[N],
	dfn[N],clk=0,pre[N],pr_e[N<<1],end[N];
double p[N<<1],q[N],f[N],f1[N<<1],s1[N<<1],s2[N<<1],ans=0;

inline void adde()
{
	int u=read(),v=read(),w=read();
	to[++ll]=v;pr_e[next[ll]=head[u]]=ll;head[u]=ll;
	to[++ll]=u;pr_e[next[ll]=head[v]]=ll;head[v]=ll;
	p[ll]=p[ll^1]=w/100.0;
}

void dfs(int u)
{
	dfn[++clk]=u;
	f[u]=1-q[u];s1[0]=s1[1]=s2[0]=s2[1]=1;
	for (int i=head[u],v;i;i=next[i])
	{
		if (i==pre[u]) 
		{
			if (i==head[u]) head[u]=next[i];
			next[pr_e[i]]=next[i];pr_e[next[i]]=pr_e[i];
			next[0]=next[1]=pr_e[0]=pr_e[1]=0;
			continue;
		}
		pre[v=to[i]]=i^1;
		dfs(v);
		double rec=1-(1-f[v])*p[i];
		f[u]*=rec;s1[i^1]=s1[pr_e[i]^1]*rec;
		if (!next[i]||next[i]==pre[u]) end[u]=i;
	}
	for (int i=end[u];i;i=pr_e[i]) s2[i^1]=s2[next[i]^1]*(1-(1-f[to[i]])*p[i]);
	for (int i=end[u];i;i=pr_e[i]) f1[i^1]=s1[pr_e[i]^1]*s2[next[i]^1]*(1-q[u]);
}

int main()
{
	n=read();
	for (int i=1;i<n;i++) adde();
	for (int i=1;i<=n;i++) q[i]=read()/100.0;
	dfs(1);f1[0]=1;
	for (int i=1;i<=n;i++) 
	{
		int u=dfn[i],v=to[pre[u]];
		if (!v) continue;
		if (pre[v]) f1[pre[u]]*=(1-(1-f1[pre[v]])*p[pre[v]]);
		f[u]*=(1-(1-f1[pre[u]])*p[pre[u]]);
	}
	for (int i=1;i<=n;i++) ans+=1-f[i];
	printf("%.6lf\n",ans);
	return 0;
}