import java.io.*;
import java.util.*;
import java.util.stream.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int k = sc.nextInt();
        int m = sc.nextInt();
        int pp = sc.nextInt();
        ArrayList<ArrayList<Integer>> graph = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            graph.add(new ArrayList<>());
        }
        for (int i = 0; i < m; i++) {
            int a = sc.nextInt() - 1;
            int b = sc.nextInt() - 1;
            graph.get(a).add(b);
            graph.get(b).add(a);
        }
        int[] stay = new int[n];
        for (int i = 0; i < n; i++) {
            stay[i] = sc.nextInt();
        }
        PriorityQueue<Path> queue = new PriorityQueue<>();
        for (int i = 0; i < k; i++) {
            queue.add(new Path(sc.nextInt() - 1, 0, 1));
        }
        int[] diseased = new int[n];
        int[] removed = new int[n];
        while (queue.size() > 0) {
            Path p = queue.poll();
            if (removed[p.source] > 0) {
                continue;
            }
            if (diseased[p.idx] > 0) {
                if (diseased[p.idx] + pp <= p.value) {
                    continue;
                } else {
                    removed[p.idx] = p.value;
                    continue;
                }
            } else {
                diseased[p.idx] = p.value;
            }
            for (int x : graph.get(p.idx)) {
                queue.add(new Path(x, p.idx, p.value + stay[p.idx]));
            }
        }
        int ans = 0;
        for (int x : removed) {
            if (x > 0) {
                ans++;
            }
        }
        System.out.println(ans);
    }
    
    static class Path implements Comparable<Path> {
        int idx;
        int source;
        int value;
        
        public Path(int idx, int source, int value) {
            this.idx = idx;
            this.source = source;
            this.value = value;
        }
        
        public int compareTo(Path another) {
            return value - another.value;
        }
    }
}
class Utilities {
    static String arrayToLineString(Object[] arr) {
        return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
    }
    
    static String arrayToLineString(int[] arr) {
        return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public int[] nextIntArray() throws Exception {
        return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
    }
    
    public String next() throws Exception {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
    
}