// Problem: E. 哈夫曼树
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

// Author: Donomonayuas

#include <bits/stdc++.h>

#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using ull = unsigned long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T>inline void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T>inline void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

mt19937_64 rnd(random_device{}());
const int maxn = 200010;
const int maxm = maxn * 50;
const ll maxv = 1e15;
map<pll, ull> MP;
map<ull, int> used;

ull get(ull x, ull y) {
  if (x > y) swap(x, y);
  if (MP.count(pll(x, y))) return MP[pll(x, y)];
  ull ha = rnd();
  while (used[ha]) ha = rnd();
  used[ha] = 1;
  return MP[pll(x, y)] = ha;
}

struct node {
  int emp, len;
  ull hal, har, ham;
  ll vall, valr;
  node() { emp = 1; }
  node(ll x, int cnt) {
    if (!cnt) {
      emp = 1;
    } else {
      emp = 0;
      len = cnt & 1;
      hal = har = get(x, x) * (cnt >> 1);
      vall = valr = x;
      if (!(cnt & 1)) ham = get(x, x) * ((cnt >> 1) - 1);
    }
  }
  friend node operator+(node x, node y) {
    node res;
    res.emp = x.emp & y.emp;
    if (res.emp) return res;
    if (x.emp) return y;
    if (y.emp) return x;
    res.len = x.len ^ y.len;
    res.vall = x.vall, res.valr = y.valr;
    if (x.len && y.len) {
      res.hal = res.har = x.har + y.hal + get(x.valr, y.vall);
      res.ham = x.hal + y.har;
    } else if (!x.len && !y.len) {
      res.hal = res.har = x.hal + y.har;
      res.ham = x.ham + y.ham + get(x.valr, y.vall);
    } else if (x.len && !y.len) {
      res.hal = x.hal + y.hal;
      res.har = x.har + get(x.valr, y.vall) + y.ham;
    } else if (!x.len && y.len) {
      res.har = x.har + y.har;
      res.hal = x.ham + get(x.valr, y.vall) + y.hal;
    }
    return res;
  }
} t[maxm];

int n, q, L[maxn], R[maxn], fa[maxn], ok[maxn], tot, rt, ls[maxm], rs[maxm], cc[maxm], dep[maxn];
ll a[maxn];
ull sum;

#define mid ((l + r) >> 1)

void upd(int &p, ll l, ll r, ll x, int v) {
  if (!p) p = ++tot;
  if (l == r) return cc[p] += v, t[p] = node(x, cc[p]), void();
  if (x <= mid) upd(ls[p], l, mid, x, v);
  else upd(rs[p], mid + 1, r, x, v);
  t[p] = t[ls[p]] + t[rs[p]];
}

#undef mid

ull get() { return t[rt].har; }

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> n >> q, q--;
  rep (i, 1, n) cin >> a[i], dep[i] = 1;
  rep (i, n + 1, 2 * n - 1) cin >> L[i] >> R[i], fa[L[i]] = fa[R[i]] = i;
  rep (i, n + 1, 2 * n - 1) dep[i] = max(dep[L[i]], dep[R[i]]) + 1;
  if (dep[2 * n - 1] > 60) {
    rep (i, 1, q + 1) cout << "NO\n";
    return 0;
  }
  rep (i, 1, n) {
    int x = fa[i];
    while (x) a[x] += a[i], x = fa[x];
  }
  rep (i, 1, 2 * n - 1) upd(rt, 1, maxv, a[i], 1);
  rep (i, n + 1, 2 * n - 1) sum += get(a[L[i]], a[R[i]]);
  cout << (sum == get() ? "YES" : "NO") << '\n';
  while (q--) {
    ll x, v;
    cin >> x >> v, v -= a[x];
    while (x) {
      if (fa[x]) sum -= get(a[L[fa[x]]], a[R[fa[x]]]);
      upd(rt, 1, maxv, a[x], -1), a[x] += v, upd(rt, 1, maxv, a[x], 1);
      if (fa[x]) sum += get(a[L[fa[x]]], a[R[fa[x]]]);
      x = fa[x];
    }
    cout << (sum == get() ? "YES" : "NO") << '\n';
  }
}