#include <stdio.h>
#include <queue>
#include <vector>

using namespace std;

typedef pair<int,int> edge;


int N,M,A,K,x,y,d,count;
const int MAX=200;


vector<edge>* graph;
int q[10000];
int dist[10000];
bool vis[10000];
int safe[10000];


inline void addEdge(int x, int y, int d){
  graph[x].push_back(edge(d,y));
  graph[y].push_back(edge(d,x));
}


int dij(int s){
  priority_queue<edge> pq;
  int ret=0;
  for (int i=0; i<N;++i){
    pq.push(edge(-MAX,i));    
    dist[i]=MAX;
    vis[i]=0;
  }
  pq.push(edge(0,s));
  dist[s]=0;

  while (1){
  edge tmp;
  int cur,dis;
  do{
    if (pq.empty()) return ret;
    tmp=pq.top(); pq.pop();
    dis=-tmp.first; cur=tmp.second;
  }while(vis[cur]);
  if (dis>=MAX) return ret;
  vis[cur]=1;
  if (dist[cur] < K)++ret;
  if (dist[cur] >= K) return ret;
  if (pq.empty()) return ret;
  safe[cur]=0;
  
  for (int i=0; i<graph[cur].size();++i)
  if (!vis[graph[cur][i].second]){
    tmp=graph[cur][i];
    if (graph[cur][i].first+dist[cur]< dist[tmp.second]){
      dist[tmp.second]=graph[cur][i].first+dist[cur];
      pq.push(edge(-(graph[cur][i].first+dist[cur]),tmp.second));
    }
  }
  }
  return ret;
}

inline void reset(){
  for (int i=0;i<N;++i) safe[i]=1;
}




int main(){
  for(;;){
  scanf("%d %d %d %d", &N, &M, &A, &K);
  reset();
  graph=new vector<edge>[N];
  if (N+M+A+K==0) break;
  for (int i=0; i<M; ++i){
    scanf("%d %d %d", &x, &y, &d);
    addEdge(--x,--y,d);
  }
  for (int i=0; i<A;++i){
    scanf("%d", &x);
    q[i]=--x;
  }
  if (A==0) printf("%d\n", N);
  for (int i = 0; i < A; ++i){
    count=dij(q[i]);
    count=0;
    for (int i=0; i<N;++i)
      if(safe[i]==1)++count;
    printf("%d\n", count);
  }
  printf("\n");
  delete[] graph;
  }
  return 0;
}