Erasing Vertices 2

#include <iostream>
#include <algorithm>
#include <queue>

using namespace std;
using ll = long long;

const int MaxN = 2e5 + 10;

struct S {
  ll x, t;

  bool operator<(const S &j) const {
    return t > j.t;
  }
};

ll a[MaxN], d[MaxN], n, m, ans;
priority_queue<S> q;
vector<int> g[MaxN];
bool vis[MaxN];

int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (int i = 1, u, v; i <= m; i++) {
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
    d[u] += a[v], d[v] += a[u];
  }
  for (int i = 1; i <= n; i++) {
    q.push({i, d[i]});
  }
  while (!q.empty()) {
    S u = q.top();
    q.pop();
    if (vis[u.x]) {
      continue;
    }
    vis[u.x] = 1, ans = max(ans, u.t);
    for (int i : g[u.x]) {
      q.push({i, (d[i] -= a[u.x])});
    }
  }
  cout << ans << endl;
  return 0;
}