1 #include<bits/stdc++.h>
  2 using namespace std;
  3 #define R register int
  4 #define AC 300050
  5 #define LL long long
  6 #define D printf("line in %d\n",__LINE__);
  7 int n, m;
  8 int date[AC], Next[AC], Head[AC], tot, cnt;//前向星
  9 LL v[AC], keep[AC];
 10 int deep[AC], a[AC], dead[AC], deadin[AC];//城池属性, 答案
 11 int b[AC], root[AC];
 12
 13 inline LL read()
 14 {
 15     LL x = 0; char c = getchar(); bool z = false;
 16     while(c > '9' || c < '0')
 17     {
 18         if(c == '-') z = true;
 19         c = getchar();
 20     }
 21     while(c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
 22     if(!z) return x;
 23     else return -x;
 24 }
 25
 26 inline void add(int f, int w)
 27 {
 28     date[++tot] = w, Next[tot] = Head[f], Head[f] = tot;
 29 }
 30
 31 struct left_heap
 32 {
 33     LL s[AC], mul[AC], lazy[AC];//骑士属性和标记,error!!!标记也要LL啊啊啊啊啊啊啊啊，因为标记也可能乘到很大啊，比如lazy和mul各种乘之类的
 34     int l[AC], r[AC], num[AC];
 35
 36     inline void pushdown(int x)
 37     {
 38         int ll = l[x], rr = r[x];//error!!!这又不是线段树啊！！！！干嘛乘2啊
 39         if(!mul[x]) return ;//如果mul为0，说明没有这个堆，所以
 40         if(mul[x] != 1)
 41         {
 42             s[ll] *= mul[x], mul[ll] *= mul[x], lazy[ll] *= mul[x];//error!!!加法标记也要乘啊！！！
 43             s[rr] *= mul[x], mul[rr] *= mul[x], lazy[rr] *= mul[x];
 44             mul[x] = 1;
 45         }
 46         if(lazy[x])
 47         {
 48             s[ll] += lazy[x], lazy[ll] += lazy[x];
 49             s[rr] += lazy[x], lazy[rr] += lazy[x];
 50             lazy[x]=0;//error!!!不是线段树啊，，，，r,l不是区间了
 51         }
 52     }
 53
 54     inline void change_add(int x, int k)
 55     {
 56         if(!x) return ;
 57         s[x] += k, lazy[x] += k;
 58     }
 59
 60     inline void change_mul(int x, int k)
 61     {
 62         if(!x) return ;
 63         s[x] *= k, lazy[x]*=k, mul[x]*=k;
 64     }
 65
 66     int merge(int x, int y)
 67     {
 68         pushdown(x), pushdown(y);
 69         if(!x || !y) return x + y;
 70     //  pushdown(x),pushdown(y);
 71         if(s[x] > s[y]) swap(x, y);
 72         r[x] = merge(r[x], y);
 73         swap(l[x], r[x]);
 74         return x;
 75     }
 76
 77     void pop(int &x)
 78     {
 79         x=merge(l[x], r[x]);
 80     }
 81
 82     inline void insert(int x, int k)
 83     {
 84         s[++cnt] = x, num[cnt] = k, mul[cnt] = 1;
 85         root[b[k]] = merge(cnt, root[b[k]]);
 86     }
 87 }heap;
 88
 89 void DFS(int x)
 90 {
 91 /*  if(a[x]) heap.change_mul(root[x],v[x]);
 92     else heap.change_add(root[x],v[x]);
 93     if(!Head[x]) return ;//如果到叶节点就返回，因为没有儿子给它了
 94     */
 95     R now;
 96     for(R i = Head[x]; i; i = Next[i])
 97     {
 98
 99         now = date[i], deep[now] = deep[x] + 1;
100         DFS(now);
101         root[x] = heap.merge(root[now], root[x]);
102     }
103     while(root[x] && heap.s[root[x]] < keep[x])
104     {
105         dead[x] ++;
106         deadin[heap.num[root[x]]] = x;
107         heap.pop(root[x]);
108     }
109     if(a[x]) heap.change_mul(root[x], v[x]);
110     else heap.change_add(root[x], v[x]);
111 }
112
113 void pre()
114 {
115     int aa;
116     n = read(), m = read();
117     deep[1] = 1;
118     for(R i = 1; i <= n; i ++) keep[i] = read(), heap.mul[i] = 1;
119     for(R i = 2; i <= n; i ++)
120     {
121         aa = read(), a[i] = read(), v[i] = read();
122         add(aa, i);
123     }
124     for(R i = 1; i <= m; i ++)
125     {
126         aa = read(), b[i] = read();
127     //  printf("%d %d\n",aa,b[i]);
128         if(aa >= keep[b[i]])//如果第一座城池打得下才建堆
129         {
130             if(!root[b[i]])
131             {
132                 root[b[i]] = ++cnt;//应该要给城池开堆,堆里存士兵，不然士兵在哪个城市有上面区别
133                 heap.num[cnt] = i, heap.s[cnt] = aa, heap.mul[cnt] = 1;//因为是给城池开的堆，所以就要存编号了
134                 //printf("%d\n",i);
135             }
136             else heap.insert(aa, i);
137         }
138         else dead[b[i]] ++, deadin[i] = b[i];//不然就别来了
139     }
140 }
141
142 void work()
143 {
144     for(R i = 1; i <= n; i ++) printf("%d\n", dead[i]);
145     printf("\n");
146     for(R i = 1; i <= m; i ++)
147         printf("%d\n", deep[b[i]] - deep[deadin[i]]);
148 }
149
150 int main()
151 {
152     freopen("in.in","r",stdin);
153     pre();
154     DFS(1);
155     work();
156     fclose(stdin);
157     return 0;
158 }