// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

typedef long long int64;



struct UnionFind{

  vector< int > data;

  UnionFind(int sz){

    data.resize(sz, -1);

  }

  int Find(int a){

    return(data[a] < 0 ? a : data[a] = Find(data[a]));

  }

  void Union(int a, int b){

    a = Find(a), b = Find(b);

    if(a == b) return;

    if(data[a] < data[b]) swap( a, b);

    data[b] += data[a];

    data[a] = b;

  }

};



struct edge {

  int to, cost;

};

struct edge2 {

  int u, v, cost;

  bool operator<(const edge2& e) const {

    return cost < e.cost;

  }

};

typedef vector< vector< edge > > Graph;

typedef pair< int, int > Pi;

const int INF = 1 << 30;

int N, M, K, Q, F[100000];

Graph graph;

vector< edge2 > weighted;

set< int > buffer[100000];

int ret[100000];



void Dijkstra(Graph& g, vector< int >& min_cost){

  min_cost.assign( g.size(), INF);

  priority_queue< Pi, vector< Pi >, greater< Pi > > que;

  for(int i = 0; i < K; i++){

    que.push( make_pair( 0, F[i]));

    min_cost[F[i]] = 0;

  }

  while(!que.empty()){

    Pi p = que.top(); que.pop();

    if(p.first > min_cost[p.second]) continue;

    for(int i = 0; i < g[p.second].size(); i++){

      edge& e = g[p.second][i];

      if(p.first + e.cost >= min_cost[e.to]) continue;

      que.push( make_pair( p.first + e.cost, e.to));

      min_cost[e.to] = p.first + e.cost;

    }

  }

}





int main(){

  scanf("%d %d %d %d", &N, &M, &K, &Q);

  graph.resize(N);

  UnionFind uftree(N);



  for(int i = 0; i < M; i++){

    int a, b, c;

    scanf("%d %d %d", &a, &b, &c);

    --a, --b;

    graph[a].push_back((edge){b, c});

    graph[b].push_back((edge){a, c});

    weighted.push_back((edge2){a, b});

  }



  for(int i = 0; i < K; i++){

    scanf("%d", &F[i]);

    --F[i];

  }

  for(int i = 0; i < Q; i++){

    int a, b;

    scanf("%d %d", &a, &b);

    --a, --b;

    buffer[a].insert(i);

    buffer[b].insert(i);

  }



  vector< int > min_cost;

  Dijkstra( graph, min_cost);

  

  for(int i = 0; i < M; i++){

    weighted[i].cost = min( min_cost[weighted[i].u], min_cost[weighted[i].v]);

  }

  sort( weighted.rbegin(), weighted.rend());



  for(int i = 0; i < M; i++){

    int u = uftree.Find(weighted[i].u), v = uftree.Find(weighted[i].v);

    if(u == v) continue;

    uftree.Union( u, v);

    int unioned = uftree.Find(weighted[i].u);

    set< int > *oo = &buffer[u], *pp = &buffer[v];

    if(u != unioned) swap( oo, pp);

    for(set< int >::iterator it = pp -> begin(); it != pp -> end(); it++){

      if(oo -> find(*it) != oo -> end()) ret[*it] = weighted[i].cost;

      else oo -> insert(*it);

    }

  }

  

  for(int i = 0; i < Q; i++){

    printf("%d\n", ret[i]);

  }

}

// Faster C++ solution for the same problem (measured speedup: 1.784689320984495x):
#include <bits/stdc++.h>

 

using namespace std;

 

const int INF = 1 << 30;

typedef pair< int, int > Pi;

 

struct UnionFind

{

  vector< int > data;

 

  UnionFind(int sz)

  {

    data.assign(sz, -1);

  }

 

  int find(int k)

  {

    if(data[k] < 0) return (k);

    return (data[k] = find(data[k]));

  }

 

  void unite(int a, int b)

  {

    a = find(a);

    b = find(b);

    if(a == b) return;

    if(data[a] > data[b]) swap(a, b);

    data[a] += data[b];

    data[b] = a;

  }

};

 

struct edge

{

  int to, cost;

};

 

struct edgee

{

  int u, v, cost;

 

  bool operator<(const edgee& e) const

  {

    return (cost < e.cost);

  }

};

 

int N, M, K, Q;

int A[200000], B[200000], L[200000];

vector< edge > graph[100000];

int min_cost[100000];

vector< edgee > es;

int S[100000], T[100000];

int l[100000], r[100000];

 

int main()

{

  scanf("%d %d %d %d", &N, &M, &K, &Q);

  for(int i = 0; i < M; i++) {

    scanf("%d %d %d", &A[i], &B[i], &L[i]);

    --A[i], --B[i];

    graph[A[i]].push_back((edge) {B[i], L[i]});

    graph[B[i]].push_back((edge) {A[i], L[i]});

  }

 

  priority_queue< Pi, vector< Pi >, greater< Pi > > que;

  fill_n(min_cost, N, INF);

 

  while(K--) {

    int F;

    cin >> F;

    min_cost[--F] = 0;

    que.emplace(0, F);

  }

 

  while(!que.empty()) {

    auto p = que.top();

    que.pop();

    if(min_cost[p.second] > p.first) continue;

    for(auto& e : graph[p.second]) {

      if(min_cost[e.to] > p.first + e.cost) {

        min_cost[e.to] = p.first + e.cost;

        que.emplace(min_cost[e.to], e.to);

      }

    }

  }

 

  for(int i = 0; i < M; i++) {

    es.emplace_back((edgee) {A[i], B[i], min(min_cost[A[i]], min_cost[B[i]])});

  }

  sort(begin(es), end(es));

  reverse(begin(es), end(es));

 

  UnionFind uf(M);

 

  for(int i = 0; i < Q; i++) {

    scanf("%d %d", &S[i], &T[i]);

    --S[i], --T[i];

    l[0] = -1, r[i] = M - 1;

  }

 

  for(int i = 0; i < 19; i++) {

    UnionFind tree(N);

    vector< Pi > querys;

    for(int j = 0; j < Q; j++) {

      if(r[j] - l[j] > 1) querys.emplace_back((l[j] + r[j]) >> 1, j);

    }

    sort(begin(querys), end(querys));

    int tail = 0;

    for(int j = 0; j < M; j++) {

      tree.unite(es[j].u, es[j].v);

      while(tail < querys.size() && querys[tail].first <= j) {

        int idx = querys[tail].second;

        int u = S[idx], v = T[idx];

        if(tree.find(S[idx]) == tree.find(T[idx])) {

          r[idx] = querys[tail].first;

        } else {

          l[idx] = querys[tail].first;

        }

        ++tail;

      }

    }

  }

 

  for(int i = 0; i < Q; i++) {

    printf("%d\n", es[r[i]].cost);

  }

}