#include<stdio.h>
#include<algorithm>
#include<assert.h>
struct{
    int v,w,nxt;
}edge[500000];
struct{
    int u,v;
}a[5000*5000+1];
int head[250001],x[250001],y[250001];
long long dis[5001][5001];
void dfs(int u,int f,int s){
    for(int i=head[u];i;i=edge[i].nxt)
        if(edge[i].v!=f)
            dis[s][edge[i].v]=dis[s][u]+edge[i].w,dfs(edge[i].v,u,s);
}
int main(){
    int n;
    scanf("%d",&n);
    assert(n<=5000);
    for(int i=1,u,v,w;i<n;++i)scanf("%d%d%d",&u,&v,&w),edge[i*2-1]={v,w,head[u]},edge[i*2]={u,w,head[v]},head[u]=i*2-1,head[v]=2*i;
    for(int i=1;i<=n;++i)scanf("%d%d",x+i,y+i);
    for(int i=1;i<=n;++i)
        dfs(i,0,i);
    for(int i=1;i<=n;++i)
        for(int j=1;j<=n;++j)
            a[(i-1)*n+j]={i,j};
    std::sort(a+1,a+n*n+1,[](const auto&x,const auto&y){return dis[x.u][x.v]<dis[y.u][y.v];});
    long long sum=0;
    for(int i=1;i<=n*n;++i)
        if(x[a[i].u]<y[a[i].u]&&x[a[i].v]>y[a[i].v]){
            if(x[a[i].u]+x[a[i].v]>=y[a[i].u]+y[a[i].v]){
                sum+=dis[a[i].u][a[i].v]*(y[a[i].u]-x[a[i].u]);
                x[a[i].v]-=y[a[i].u]-x[a[i].u],x[a[i].u]=y[a[i].u];
            }else{
                sum+=dis[a[i].u][a[i].v]*(x[a[i].v]-y[a[i].v]);
                x[a[i].u]+=x[a[i].v]-y[a[i].v],x[a[i].v]=y[a[i].v];
            }
        }
    printf("%lld",sum);
    return 0;
}