#include namespace { #pragma GCC diagnostic ignored "-Wunused-function" #include #pragma GCC diagnostic warning "-Wunused-function" using namespace std; using namespace atcoder; #define rep(i,n) for(int i = 0; i < (int)(n); i++) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--) #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) template bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; } template bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; } using ll = long long; using P = pair; using VI = vector; using VVI = vector; using VL = vector; using VVL = vector; } int main() { ios::sync_with_stdio(false); cin.tie(0); int n, k, m, p; cin >> n >> k >> m >> p; struct S { ll t; int u, v; bool operator<(const S& rhs) const { return t > rhs.t; } }; priority_queue evs; vector removed(n); VI time(n, -1); VVI to(n); rep(_, m) { int u, v; cin >> u >> v; u--, v--; to[u].emplace_back(v); to[v].emplace_back(u); } VI s(n); rep(i, n) cin >> s[i]; auto infect = [&](int i, ll t) { t += s[i]; for(int j: to[i]) evs.push({t, i, j}); }; rep(_, k) { int x; cin >> x; x--; time[x] = 0; infect(x, 0); } while(evs.size()) { auto [t, u, v] = evs.top(); evs.pop(); if (removed[u]) continue; if (time[v] == -1) { time[v] = t; infect(v, t); } else if (!removed[v] && t < time[v] + p) { removed[v] = true; } } int ans = accumulate(all(removed), 0); cout << ans << '\n'; }