#include<bits/stdc++.h> #define ll long long #define pii pair<int,int> #define fi first #define se second #define mk make_pair using namespace std; const int N=2200; int n,V=2010; ll f[N][N];int w[N]; vector<pii> E[N]; void dfs(int u,int fa){ for(int i=0;i<=V;i++){ f[u][i]=1ll*i*w[u]; }for(auto ed:E[u]){ int v=ed.fi,w=ed.se; if(v==fa) continue; dfs(v,u); for(int i=0;i<=V;i++){ int to=w-i; if(to<0) f[u][i]=-2e18; else f[u][i]+=f[v][to]; } }for(int i=1;i<=V;i++){ //cout<<u<<' '<<i<<' '<<f[u][i]<<endl; f[u][i]=max(f[u][i],f[u][i-1]); } } int main(){ cin>>n; for(int i=1;i<=n;i++) cin>>w[i]; for(int i=1;i<n;i++){ int u,v,w;cin>>u>>v>>w; E[u].push_back(mk(v,w)); E[v].push_back(mk(u,w)); }//memset(f,0x3f,sizeof(f)); dfs(1,0);cout<<f[1][V]<<endl; }