#include<iostream>
 #include<cstdio>
 #include<cstdlib>
 #include<cstring>
 #include<algorithm>
 #include<string>
 #define N 200000+20
 using namespace std;
 ];
 ;
 void link(int x,int y){
     nxt[++tot]=head[x];
     to[tot]=y;
     head[x]=tot;
 }
 void dfs(int x,int fa){
     dp[x][]=a[x];//0为在独立集里
     dp[x][]=;//1为不在
     for (int i=head[x];i;i=nxt[i]){
         if (to[i]==fa) continue;
         dfs(to[i],x);
         dp[x][]+=dp[to[i]][];
         dp[x][]+=max(dp[to[i]][],dp[to[i]][]);
     }
 }
 int main(){
     scanf ("%d",&n);
     ;i<=n;++i) scanf ("%d",&a[i]);
     int x,y;
     ;i<n;++i){
         scanf ("%d%d",&x,&y);
         link(x,y),link(y,x);
     }
     dfs(,);
     printf (][],dp[][]));
     ;
   }

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#define maxn 300000
#define INF 10000100
using namespace std;
,root=,sum,f[maxn][],ans=,g[maxn],sz[maxn];
void link(int x,int y)
{
    nxt[++tot]=head[x];
    to[tot]=y;
    head[x]=tot;
}
void dfs(int x)
{
    if (!sz[x])//0 靠爸爸 1 靠儿子 2 靠自己
    {
        f[x][]=,f[x][]=INF>>,f[x][]=v[x];
        return ;
    }
        ,fl=;
    for (int i=head[x];i;i=nxt[i])
    {
        int t=to[i];
        dfs(t);
        f[x][]+=min(f[t][],min(f[t][],f[t][]));
        f[x][]+=f[t][];
        ]>=f[t][]) fl=,s2+=f[t][];
        ],s1=min(s1,f[t][]-f[t][]);
    }
    f[x][]+=v[x];
    f[x][]=s2;
    ]+=s1;
}
int main()
{
    int n;
    scanf ("%d",&n);
    ;i<=n;++i)
    {
        int x,y,z,k;
        scanf ("%d%d%d",&x,&y,&z);
        v[x]=y,sz[x]=z;
                ;j<=z;++j)
        {
            scanf ("%d",&k);
            link(x,k);
            g[k]=;
        }
    }
    ;i<=n;++i) if (!g[i]) root=i;
    dfs(root);
    cout<<min(f[root][],f[root][]);
    ;
}    

 #include<iostream>
 #include<cstdio>
 #include<cstdlib>
 #include<cstring>
 #include<algorithm>
 #include<string>
 #define ll long long
 #define db double
 #define N 20000
 #define inf 1000000000
 using namespace std;
 ];
 ;
 void link(int x,int y){
     nxt[++tot]=head[x];
     to[tot]=y;
     head[x]=tot;
 }
 void dfs(int x,int fa){
     dp[x][]=,dp[x][]=,dp[x][]=;//0属于 1靠儿子 2靠父亲
     ,q=inf;
     for (int i=head[x];i;i=nxt[i]){
         int t=to[i];
         if (t==fa) continue;
         dfs(t,x);
         dp[x][]+=min(dp[t][],min(dp[t][],dp[t][]));
         ]!=inf&&dp[x][]!=inf) dp[x][]+=dp[t][];
         ]=inf;
         ]>=dp[t][]) dp[x][]+=dp[t][],fl=t;
         ]+=dp[t][];
         q=min(q,dp[t][]-dp[t][]);
     }
     ]+=q;
     ])  dp[x][]=inf;
 }
 int main(){
     int n;
     scanf ("%d",&n);
     int x,y;
     ;i<n;++i){
         scanf ("%d%d",&x,&y);
         link(x,y),link(y,x);
     }
     dfs(,);
     printf (][],dp[][]));
     ;
   }

 #include<iostream>
 #include<cstdio>
 #include<cstdlib>
 #include<cstring>
 #include<algorithm>
 #include<string>
 #include<queue>
 #include<vector>
 #define ll long long
 #define db double
 #define N 5000
 using namespace std;
 ;
 int w[N],d[N],k[N],de[N][N],ans[N],f[N][N];
 struct hh{
     int to,nxt,w;
 }b[N];
 int head[N];
 void link(int x,int y,int w){
     b[++tot].nxt=head[x];
     b[tot].to=y;
     b[tot].w=w;
     head[x]=tot;
 }
 void dis(int x,int y,int fa,int di){
     de[x][y]=min(de[x][y],di);
     for (int i=head[y];i;i=b[i].nxt){
         int v=b[i].to;
         if (v==fa) continue;
         dis(x,v,y,di+b[i].w);
     }
 }
 void dp(int x,int fa){
     for (int i=head[x];i;i=b[i].nxt){
         int t=b[i].to;
         if (t==fa) continue;
         dp(t,x);
     }
     ;i<=n;++i){
         if (de[x][i]>d[x]) continue;
         f[x][i]=w[i];
         for (int j=head[x];j;j=b[j].nxt){
             int k=b[j].to;
             if (k==fa) continue;
             f[x][i]+=min(f[k][i]-w[i],ans[k]);
         }
         ans[x]=min(ans[x],f[x][i]);
     }
 }
 int main(){
     scanf ("%d",&n);
     ;i<=n;++i) scanf ("%d",&w[i]);
     ;i<=n;++i) scanf ("%d",&d[i]);
     int x,y,z;
     ;i<n;++i){
         scanf ("%d%d%d",&x,&y,&z);
         link(x,y,z);link(y,x,z);
     }
     memset(f,0x3f,sizeof(f));
     memset(de,0x3f,sizeof(de));
     memset(ans,0x3f,sizeof(ans));
     ;i<=n;++i) dis(i,i,,);
     dp(,);
     printf (]);
     ;
   }