#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define SZ(x) ((int)(x).size())
#define D(...) fprintf(stderr,__VA_ARGS__)
using namespace std;
using LL=long long;
const int N=200005;
int n,Q,fa[N],son[N][2],dep[N];
LL sum[N];
struct cmp{
    bool operator()(const int &x,const int&y)const{return sum[x]!=sum[y]?sum[x]<sum[y]:x<y;}
};
set<int,cmp>S[N];
int mx,tot,need;
bool solve(){
    int flag=1;
    rep(i,1,mx){
        flag&=cmp()(*--S[i].end(),*S[i-1].begin());
    }
    if(!flag)return 0;
    return tot==need;
}
int F(int u,int v){
    if(u<=n||v<=n)return 1;
    return max(sum[son[u][0]],sum[son[u][1]])<=min(sum[son[v][0]],sum[son[v][1]]);
}
void del(int p){
    
    auto it=S[dep[p]].find(p);
    if(it!=S[dep[p]].begin()){
        tot-=F(*prev(it),*it);
    }
    if(next(it)!=S[dep[p]].end()){
        tot-=F(*it,*next(it));
    }
    if(it!=S[dep[p]].begin()&&next(it)!=S[dep[p]].end()){
        tot+=F(*prev(it),*next(it));
    }
    S[dep[p]].erase(it);
}
void ins(int p){
    auto it=S[dep[p]].insert(p).first;
    if(it!=S[dep[p]].begin()){
        tot+=F(*prev(it),*it);
    }
    if(next(it)!=S[dep[p]].end()){
        tot+=F(*it,*next(it));
    }
    if(it!=S[dep[p]].begin()&&next(it)!=S[dep[p]].end()){
        tot-=F(*prev(it),*next(it));
    }
}
void add(int p,LL v){
    while(p){
//        D("p=%d v=%lld\n",p,v);
        del(p);
        sum[p]+=v;
        ins(p);
        p=fa[p];
    }
}
int main(){
#ifdef xay5421
    freopen("a.in","r",stdin);
#endif
    ios::sync_with_stdio(0),cin.tie(0);
    cin>>n>>Q;
    rep(i,1,n)cin>>sum[i];
    rep(i,n+1,n*2-1){
        cin>>son[i][0]>>son[i][1];
        fa[son[i][0]]=i;
        fa[son[i][1]]=i;
        sum[i]=sum[son[i][0]]+sum[son[i][1]];
    }
    per(i,n*2-1,0){
        dep[son[i][0]]=dep[i]+1;
        dep[son[i][1]]=dep[i]+1;
    }
    mx=*max_element(dep+1,dep+n*2);
    rep(i,1,n*2-1){
        S[dep[i]].insert(i);
    }
    rep(i,0,mx){
        for(auto it=S[i].begin();it!=S[i].end();++it){
            if(it!=S[i].begin()){
                tot+=F(*prev(it),*it);
                need+=1;
            }
        }
    }
    rep(tc,1,Q){
        if(tc>1){
            int p;
            LL v;
            cin>>p>>v;
            v-=sum[p];
            add(p,v);
        }
//        D("tc=%d need=%d tot=%d\n",tc,need,tot);
//        rep(i,0,mx){
//            for(auto it=S[i].begin();it!=S[i].end();++it){
//                D("(%d,sum=%lld,[%d,%d])",*it,sum[*it],min(sum[son[i][0]],sum[son[i][1]]),max(sum[son[i][0]],sum[son[i][1]]));
//            }
//            D("\n");
//        }
        puts(solve()?"YES":"NO");
    }
    return 0;
}