#include<iostream>
#include<cstdio>
#include<ctime>
#include<cstdlib>
const int N=10;
const int MAX=10;
using namespace std;
int mrand()
{
    int x=rand()%MAX,f=rand()%2;
    if(f==0) f=-1;
    return x*f;
}
int main()
{
    srand(time(NULL));
    freopen("3261.in","w",stdout);

    int n=N,m=N;
    cout<<n<<" "<<m<<endl;
    for(int i=1;i<=n;i++)
        cout<<mrand()<<" ";
    cout<<endl;

    for(int i=2;i<=n;i++)
    {
        int to=rand()%i;
        if(to==0) to=1;
        cout<<to<<" "<<rand()%2<<" "<<mrand()<<endl;
    }

    for(int i=1;i<=m;i++)
        cout<<mrand()<<" "<<rand()%n+1<<endl;
    return 0;
}

//Luogu P3261 [JLOI2015]城池攻占
//Mar,8th,2019
//左偏树+线段树II
#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
long long read()
{
    long long x=0,f=1; char c=getchar();
    while(!isdigit(c)){if(c=='-') f=-1;c=getchar();}
    while(isdigit(c)){x=x*10+c-'0';c=getchar();}
    return x*f;
}
const int N=300000+1000;
struct LST
{
    long long plus[N],take[N],w[N],son[N][2],dis[N],fa[N];
    inline void pushdown(int x)//传入位置
    {
        if(son[x][0]!=0)
        {
            w[son[x][0]]=w[son[x][0]]*take[x]+plus[x];
            take[son[x][0]]*=take[x];
            plus[son[x][0]]=plus[son[x][0]]*take[x]+plus[x];
        }
        if(son[x][1]!=0)
        {
            w[son[x][1]]=w[son[x][1]]*take[x]+plus[x];
            take[son[x][1]]*=take[x];
            plus[son[x][1]]=plus[son[x][1]]*take[x]+plus[x];
        }
        plus[x]=0,take[x]=1;
    }
    int findFather(int x)//传入位置
    {
        if(fa[x]==0) return x;
        return fa[x]=findFather(fa[x]);
    }
    int Merge(int x,int y)//传入根的位置
    {
        if(x==0 or y==0) return x+y;
        if(w[x]<w[y]) swap(x,y);
        pushdown(x),pushdown(y);
        son[y][1]=Merge(x,son[y][1]),fa[son[y][1]]=y;
        if(dis[son[y][0]]<dis[son[y][1]]) 
            swap(son[y][0],son[y][1]);
        dis[y]=dis[son[y][1]]+1;    
        return y;
    }
    int Pop(int x)//返回新的根的位置
    {
        pushdown(x);
        fa[x]=Merge(son[x][0],son[x][1]);
        return fa[x];
    }
    void Mark(int x,long long ntake,long long nplus)
    {
        pushdown(x);
        w[x]=w[x]*ntake+nplus;
        take[x]=ntake,plus[x]=nplus;
    }
}lst;
int n,m,root[N],ans1[N],ans2[N];
long long a[N],v[N],h[N];
vector <int> e[N];
int depth[N],from[N];
void dfs(int now)
{
    for(int i=0;i<int(e[now].size());i++)
    {
        depth[e[now][i]]=depth[now]+1;
        dfs(e[now][i]);
        if(root[e[now][i]]!=0)
            root[now]=lst.Merge(root[now],root[e[now][i]]);
    }
    while(root[now]!=0 and lst.w[root[now]]<h[now])
    {
        ans1[now]++,ans2[root[now]]=depth[from[root[now]]]-depth[now];
        root[now]=lst.Pop(root[now]);
    }
    if(v[now]==0)
        lst.Mark(root[now],1,a[now]);
    else
        lst.Mark(root[now],a[now],0);
}
int main()
{
    int t=clock();
    freopen("3261.in","r",stdin);
    freopen("3261.out","w",stdout);

    int size = 256 << 20;
    char *p = (char*)malloc(size) + size;
    __asm__("movl %0, %%esp\n" :: "r"(p));

    n=read(),m=read();
    for(int i=1;i<=n;i++)
        h[i]=read();
    for(int i=1;i<=n;i++)
        e[i].reserve(4);
    for(int i=2;i<=n;i++)
    {
        e[read()].push_back(i);
        v[i]=read(),a[i]=read();
    }
    for(int i=1;i<=m;i++)
    {
        long long w=read();
        from[i]=read();
        lst.w[i]=w;
        if(root[from[i]]==0)
            root[from[i]]=i;
        else
            root[from[i]]=lst.Merge(root[from[i]],i);
    }

    depth[1]=1;
    dfs(1);
    while(root[1]!=0)
    {
        ans2[root[1]]=depth[from[root[1]]];
        root[1]=lst.Pop(root[1]);
    }

    for(int i=1;i<=n;i++)
        printf("%d\n",ans1[i]);
    for(int i=1;i<=m;i++)
        printf("%d\n",ans2[i]);
    cerr<<clock()-t;
    return 0;
}