#include<cstdio>
const int N=1e5+1;
bool f[N];
int i,j,k,n,t,a[N],sz[N];
int fa[N],en[N],nxt[N],w[N];
void dfs(int u,long long d)
{
if(d>a[u])return;
if(d<0)d=0;
for(int i=fa[u];i;i=nxt[i])
dfs(en[i],d+w[i]);
f[u]=1;
}
int main()
{
scanf("%d",&n);
for(i=1;i<=n;++i)
scanf("%d",a+i);
for(i=2;i<=n;w[i++]=t)
{
scanf("%d%d",&j,&t);
en[i]=i,nxt[i]=fa[j],fa[j]=i;
}
for(dfs(i=1,j=0);i<=n;++i)j+=f[i];
printf("%d",n-j);
} 1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |