#ifndef LOCAL
#define FAST_IO
#endif

// ============
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32)(n); ++i)
#define REP3(i, m, n) for (i32 i = (i32)(m); i < (i32)(n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32)(n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using i32 = signed int;
using i64 = signed long long;
using f64 = double;
using f80 = long double;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

#ifdef INT128

using u128 = __uint128_t;
using i128 = __int128_t;

istream &operator>>(istream &is, i128 &x) {
    i64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, i128 x) {
    os << (i64)x;
    return os;
}
istream &operator>>(istream &is, u128 &x) {
    u64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, u128 x) {
    os << (u64)x;
    return os;
}

#endif

[[maybe_unused]] constexpr i32 INF = 1000000100;
[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;
struct SetUpIO {
    SetUpIO() {
#ifdef FAST_IO
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
#endif
        cout << fixed << setprecision(15);
    }
} set_up_io;
// ============

#ifdef DEBUGF
#else
#define DBG(x) (void)0
#endif

int main() {
    i32 n, k, m, p;
    cin >> n >> k >> m >> p;
    Vec<Vec<i32>> g(n);
    REP(i, m) {
        i32 u, v;
        cin >> u >> v;
        --u;
        --v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    Vec<i32> s(n);
    REP(i, n) {
        cin >> s[i];
    }
    Vec<i32> x(k);
    REP(i, k) {
        cin >> x[i];
        --x[i];
    }
    Vec<i32> state(n, 0);
    Vec<i32> out(n, 0);
    priority_queue<tuple<i32, i32, i32>, Vec<tuple<i32, i32, i32>>, greater<>> pq;
    REP(i, k) {
        state[x[i]] = 1;
        pq.emplace(s[x[i]], 1, x[i]);
        pq.emplace(p, 0, x[i]);
    }
    i32 cnt = 0;
    while (!pq.empty()) {
        auto [d, type, v] = pq.top();
        pq.pop();
        if (state[v] == -1 && d > out[v]) {
            continue;
        }
        if (type == 1) {
            for (i32 u : g[v]) {
                if (state[u] == 0) {
                    state[u] = 1;
                    pq.emplace(d + s[u], 1, u);
                    pq.emplace(d + p, 0, u);
                } else if (state[u] == 1) {
                    ++cnt;
                    state[u] = -1;
                    out[u] = d;
                }
            }
        } else {
            state[v] = 2;
        }
    }
    cout << cnt << '\n';
}