1 // luogu-judger-enable-o2
 2 //minamoto
 3 #include<iostream>
 4 #include<cstdio>
 5 #include<cstring>
 6 #include<algorithm>
 7 #include<queue>
 8 #define ll long long
 9 using namespace std;
10 #define getc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
11 char buf[1<<21],*p1=buf,*p2=buf;
12 inline ll read(){
13     #define num ch-'0'
14     char ch;bool flag=0;ll res;
15     while(!isdigit(ch=getc()))
16     (ch=='-')&&(flag=true);
17     for(res=num;isdigit(ch=getc());res=res*10+num);
18     (flag)&&(res=-res);
19     #undef num
20     return res;
21 }
22 char sr[1<<21],z[20];int C=-1,Z;
23 inline void Ot(){fwrite(sr,1,C+1,stdout),C=-1;}
24 inline void print(ll x){
25     if(C>1<<20)Ot();if(x<0)sr[++C]=45,x=-x;
26     while(z[++Z]=x%10+48,x/=10);
27     while(sr[++C]=z[Z],--Z);sr[++C]='\n';
28 }
29 const int N=100005;
30 struct query{ll t,res;int id;}ask[N];
31 inline bool cmp1(query x,query y){return x.t<y.t;}
32 inline bool cmp2(query x,query y){return x.id<y.id;}
33 struct node{
34     ll t;int x;node(){}
35     node(ll t,int x):t(t),x(x){}
36     inline bool operator <(const node &b)const
37     {return t>b.t;}
38 };
39 priority_queue<node> q;
40 int fa[N],f[N],lim[N];ll cow[N],pass[N];
41 int find(int x){
42     return fa[x]==x?x:fa[x]=find(fa[x]);
43 }
44 int n,m;
45 int main(){
46 //    freopen("testdata.in","r",stdin);
47     n=read(),m=read();
48     for(int i=1;i<=n;++i) fa[i]=i;
49     for(int i=2;i<=n;++i)
50     f[i]=read(),cow[i]=read(),lim[i]=read(),pass[f[i]]-=lim[i],pass[i]+=lim[i];
51     for(int i=1;i<=m;++i)
52     ask[i].t=read(),ask[i].id=i;
53     sort(ask+1,ask+1+m,cmp1);
54     for(int i=2;i<=n;++i)
55     if(pass[i]>0)
56     q.push(node(cow[i]/pass[i],i));
57     int l=1,x,tp;
58     while(!q.empty()&&l<=m){
59         while(l<=m&&ask[l].t<=q.top().t)
60         ask[l].res=cow[1]-pass[1]*ask[l].t,++l;
61         if(fa[q.top().x]!=q.top().x){q.pop();continue;}
62         x=q.top().x,tp=find(f[x]),cow[tp]+=cow[x];
63         pass[tp]+=pass[x],fa[x]=tp;
64         if(pass[tp]>0) q.push(node(cow[tp]/pass[tp],tp));
65         q.pop();
66     }
67     sort(ask+1,ask+1+m,cmp2);
68     for(int i=1;i<=m;++i) print(ask[i].res);
69     Ot();
70     return 0;
71 }