//bfs(TLE解法)
#include <iostream>
#include <algorithm>
#include <atcoder/all>
#include <cassert>
#include <set>
using namespace std;
using namespace atcoder;
using ll = long long;
ll N, M, P, Y;

vector<vector<pair<ll, ll>>> G;
vector<ll> bfs(ll start = 0) {
  ll n = G.size();
  vector<ll> dist(n, -1);
  queue<ll> que;
  que.emplace(start);
  dist[start] = Y;
  while(!que.empty()){
    int pos = que.front(); que.pop();
    for(ll i = 0; i < G[pos].size(); i++){
      auto [to, cost] = G[pos][i];
      if(dist[pos] >= cost && dist[pos] - cost > dist[to]){
        dist[to] = dist[pos] - cost ;
        que.push(to);
      }
    }
  }
  return dist;
}

int main(){
  cin >> N >> M >> P >> Y;
  assert(2 <= N && N <= 200000);
  assert(1 <= M && M <= min(1LL * 200000, N*(N-1)/2));
  assert(1 <= P && P <= N);
  assert(1 <= Y && Y <= 1e18);
  G.resize(N + 1);
  set<pair<ll,ll>> st;
  for(int i = 1; i <= M; i++){
    ll a, b, c;
    cin >> a >> b >> c;
    assert(1 <= a && a <= N);
    assert(1 <= b && b <= N);
    assert(a < b);
    assert(1 <= c && c <= 1e9);
    G[a].push_back({b, c});
    G[b].push_back({a, c});
    assert(st.find({a, b}) == st.end());
    st.insert({a, b});
  }
  auto ret = bfs(1);
  ll ans = 0;
  set<ll> st2;
  for(int i = 1; i <= P; i++){
    ll d, e;
    cin >> d >> e;
    assert(1 <= d && d <= N);
    assert(1 <= e && e <= 1e9);
    assert(st2.find(d) == st2.end());
    st2.insert(d);
    ans = max(ans, ret[d] / e);
  }
  cout << ans << endl;
  return 0;
}