#include <stdio.h>
#include <vector>
#define NN 10001
using namespace std;

int N, M, A, K;

typedef struct edge{
	int b, w;
} edge;

vector< vector<edge> > edges;
int marked[NN], doomed[NN];
int count;

void DFS(int v, int d){
	if(d >= K)
		return;
	marked[v] = 1;
	if(doomed[v] == 0){
		//printf("killing %d\n", v);
		doomed[v] = 1;
		count--;
	}
	int k = edges[v].size();
	for(int j=0; j<k; j++){
		int u = edges[v][j].b;
		if(!marked[u] && !(doomed[u] == 2)){
			DFS(u, d + edges[v][j].w);
		}
	}
	marked[v] = 0;
}

int main(){
while(1){
	scanf("%d %d %d %d", &N, &M, &A, &K);
	if(N == 0 && M == 0 && A == 0 && K == 0)
		break;
	int i, T1, T2, D, B;
	edges = vector< vector<edge> >(N);
	edge e;
	
	for(i=0; i<N; i++){
		marked[i] = doomed[i] = 0;
	}
	for(i=0; i<M; i++){
		scanf("%d %d %d", &T1, &T2, &D);
		e.w = D;
		e.b = T2-1;
		edges[T1-1].push_back(e);
		e.b = T1-1;
		edges[T2-1].push_back(e);
	}
	count = N;
	for(i=0; i<A; i++){
		scanf("%d", &B);
		B--;
		if(doomed[B] != 2){
			if(doomed[B] == 0)
				count--;
			doomed[B] = 2;
			DFS(B, 0);
		}
		printf("%d\n", count);
	}
	printf("\n");
}
	return 0;
}