1 /**************************************************************
 2     Problem: 4003
 3     User: Tunix
 4     Language: C++
 5     Result: Accepted
 6     Time:4380 ms
 7     Memory:42216 kb
 8 ****************************************************************/
 9  
10 //Huce #5 B
11 #include<queue>
12 #include<vector>
13 #include<cstdio>
14 #include<cstdlib>
15 #include<cstring>
16 #include<iostream>
17 #include<algorithm>
18 #define rep(i,n) for(int i=0;i<n;++i)
19 #define F(i,j,n) for(int i=j;i<=n;++i)
20 #define D(i,j,n) for(int i=j;i>=n;--i)
21 #define pb push_back
22 using namespace std;
23 typedef long long LL;
24 LL getint(){
25     LL v=0,sign=1; char ch=getchar();
26     while(ch<‘0‘||ch>‘9‘) {if (ch==‘-‘) sign=-1; ch=getchar();}
27     while(ch>=‘0‘&&ch<=‘9‘) {v=v*10+ch-‘0‘; ch=getchar();}
28     return v*sign;
29 }
30 const int N=300010;
31 const LL INF=1e17;
32 /*******************tamplate********************/
33 int head[N],to[N],next[N],cnt;
34 void add(int x,int y){
35     to[++cnt]=y; next[cnt]=head[x]; head[x]=cnt;
36 }
37 int fa[N],a[N],n,m,c[N],die[N];
38 LL h[N],v[N];
39 struct node{
40     LL v,mul,add; int l,r,dis;
41 }t[N];
42 #define L t[x].l
43 #define R t[x].r
44 void update(int x,LL mul,LL add){
45     if (!x) return;
46     if (mul==1 && add==0) return;
47     t[x].v=t[x].v*mul+add;
48     t[x].add=t[x].add*mul+add;
49     t[x].mul*=mul;
50 }
51 void Push_down(int x){
52     update(L,t[x].mul,t[x].add);
53     update(R,t[x].mul,t[x].add);
54     t[x].mul=1; t[x].add=0;
55 }
56 int merge(int x,int y){
57     if (!x||!y) return x+y;
58     if (t[x].v>t[y].v) swap(x,y);
59     Push_down(x);
60     R=merge(R,y);
61     if (t[L].dis<t[R].dis) swap(L,R);
62     t[x].dis=t[R].dis+1;
63     return x;
64 }
65 int dep[N],rt[N],death[N];
66 void dfs(int x){
67     for(int i=head[x];i;i=next[i]){
68         dep[to[i]]=dep[x]+1; dfs(to[i]);
69         rt[x]=merge(rt[x],rt[to[i]]);
70     }
71     while(rt[x] && t[rt[x]].v<h[x]){
72         death[x]++;
73         Push_down(rt[x]);
74         die[rt[x]]=x;
75         rt[x]=merge(t[rt[x]].l,t[rt[x]].r);
76     }
77     if (a[x]) update(rt[x],v[x],0);
78     else update(rt[x],1,v[x]);
79 }
80 int main(){
81 #ifndef ONLINE_JUDGE
82     freopen("B.in","r",stdin);
83 #endif
84     n=getint(); m=getint(); t[0].v=INF;
85     F(i,1,n) h[i]=getint();
86     F(i,2,n){
87         fa[i]=getint(); a[i]=getint(); v[i]=getint();
88         add(fa[i],i);
89     }
90     F(i,1,m){
91         t[i].v=getint();t[i].add=0;t[i].mul=1; c[i]=getint();
92         rt[c[i]]=merge(rt[c[i]],i);
93     }
94     dep[1]=1; dfs(1);
95     F(i,1,n) printf("%d\n",death[i]);
96     F(i,1,m) printf("%d\n",dep[c[i]]-dep[die[i]]);
97     return 0;
98 }