// 私は猫です

#include<bits/stdc++.h>
#define int long long
#define ull unsigned long long
#define ll long long
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
#define inf 1000000000
#define infll 1000000000000000000ll
#define pii pair<int,int>
#define rep(i,a,b,c) for(int i=(a);i<=(b);i+=(c))
#define per(i,a,b,c) for(int i=(a);i>=(b);i-=(c))
#define F(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define dF(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define cmh(sjy) while(sjy--)
#define lowbit(x) (x&(-x))
#define HH printf("\n")
#define eb emplace_back
#define poly vector<int>
#define SZ(x) ((int)x.size())
using namespace std;
template<typename T>inline void chkmax(T &x,const T &y){ x=std::max(x,y); }
template<typename T>inline void chkmin(T &x,const T &y){ x=std::min(x,y); }
const int mod=998244353,NR=500005,V=80;
int minn[NR][90],maxn[NR][90];
int n,q;
int a[NR];
int son[NR][2];
int rt;
int v[NR];
int dep[NR];
int father[NR];
int ans;
int vis[NR];
inline void change(int x){
    if(x<=n){minn[x][dep[x]]=maxn[x][dep[x]]=v[x];return;}
    int s1,s2;s1=son[x][0],s2=son[x][1];
    ans-=vis[x];vis[x]=0;
    if(v[s1]>v[s2]) swap(s1,s2);
    int fl=0;
    F(i,dep[x]+1,V){
        int v1=maxn[s1][i],v2=minn[s2][i];
        if(v1>v2) fl=1;
        maxn[x][i]=max(maxn[s1][i],maxn[s2][i]);
        minn[x][i]=min(minn[s1][i],minn[s2][i]);
    }
    vis[x]=fl;ans+=vis[x];
    v[x]=v[s1]+v[s2];maxn[x][dep[x]]=minn[x][dep[x]]=v[x];
}
inline void dfs(int x,int fa){
    dep[x]=dep[fa]+1;father[x]=fa;
    F(i,0,1) if(son[x][i]) dfs(son[x][i],x);
}
inline void out(){
    if(ans) puts("NO");
    else {
        F(i,1,V-1) if(minn[rt][i]<maxn[rt][i+1]) {puts("NO");return;}
        puts("YES");
    }
}
void solve(){
    cin>>n>>q;
    F(i,1,n)cin>>a[i],v[i]=a[i];
    F(i,n+1,2*n-1)cin>>son[i][0]>>son[i][1];
    rt=2*n-1,dfs(rt,0);
    int Max=0;
    F(i,1,2*n-1) Max=max(Max,dep[i]);
    if(Max>=55){
        F(i,1,q) puts("NO");
        return;
    }
    F(i,1,2*n-1) F(j,0,V) maxn[i][j]=0,minn[i][j]=infll;
    F(i,1,2*n-1) change(i);
    out();
    --q;
    while(q--){
        int x,k; cin>>x>>k;
        v[x]=k;
        while(1){
            change(x);
            if(x==rt) break;
            x=father[x];
        }
        out();
    }
}
signed main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int zsy=1;
	F(____,1,zsy)solve();
}