#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001


int main(){
	
	int N,K,M,P;
	cin>>N>>K>>M>>P;
	
	vector<vector<int>> E(N);
	rep(i,M){
		int u,v;
		cin>>u>>v;
		u--,v--;
		E[u].push_back(v);
		E[v].push_back(u);
	}
	
	vector<int> s(N);
	rep(i,N)cin>>s[i];
	using Pd = pair<int,int>;
	priority_queue<Pd,vector<Pd>,greater<Pd>> Q;
	
	vector<int> mode(N);
	rep(i,K){
		int x;
		cin>>x;
		x--;
		mode[x]++;
		Q.emplace(P*3,x);
		Q.emplace(s[x]*3+1,x);
	}
	
	while(Q.size()>0){
		int day = Q.top().first;
		int x = Q.top().second;
		Q.pop();
		//cout<<day<<' '<<x<<endl;
		if(mode[x]==-2)continue;
		if(day%3==0){
			mode[x] = -1;
		}
		if(day%3==1){
			rep(i,E[x].size()){
				int to = E[x][i];
				//cout<<to<<endl;
				if(mode[to]>=0){
					if(mode[to]==1){
						mode[to]++;
						Q.emplace(day+1,to);
					}
					if(mode[to]==0){
						mode[to]++;
						Q.emplace(((day/3)+P)*3,to);
						Q.emplace(((day/3)+s[to])*3+1,to);
					}
					
				}
			}
		}
		if(day%3==2){
			mode[x] = -2;
		}
	}
	int ans = 0;
	rep(i,N){
		//cout<<mode[i]<<endl;
		if(mode[i]==-2)ans++;
	}
	cout<<ans<<endl;
	
	return 0;
}