//一応 long longで提出
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,a,b) for(ll i=(ll)a; i<(ll)b; i++)
#define all(x) x.begin(),x.end()
const ll INF = 1ll<<40;
#define chmin(a,b) a = min(a,b)
#define chmax(a,b) a = max(a,b)
#include<atcoder/dsu>
using namespace atcoder;
int main() {
   ll N, M, X, K; cin >> N >> M >> X >> K;
   vector<ll> A(N); rep(i,0,N) cin >> A[i];
   dsu D(2*N);
   vector<ll> plus(N, INF), minus(N, -INF);
   rep(i,0,M) {
      ll u, v; cin >> u >> v;
      u -- , v -- ;
      if (A[u] > A[v]) swap(u,v);
      if (A[v] - A[u] <= X) D.merge(u, v + N);
      chmin(plus[u], A[v]);
      chmax(minus[v], A[u]);
   }
   rep(i,0,N) if (K == 2 || plus[i] - minus[i] <= X) D.merge(i, i + N);
   ll ans = 0;
   auto G = D.groups();
   for (auto&&g: G) {
      for (auto&&x: g) x %= N;
      sort(all(g));
      g.erase(unique(all(g)), g.end());
   }
   vector<vector<ll>> rG(N);
   rep(i,0,G.size()) for (auto x: G[i]) rG[x].push_back(i);
   map<pair<ll, ll>, ll> cnt;
   rep(i,0,N) if (rG[i].size() == 2) cnt[make_pair(rG[i][0],rG[i][1])] ++ ;
   rep(i,0,N) {
      if (rG[i].size() == 1) ans += (ll)G[rG[i][0]].size() - 1;
      else ans += (ll)G[rG[i][0]].size() + (ll)G[rG[i][1]].size() - cnt[make_pair(rG[i][0],rG[i][1])] - 1;
   }
   cout << ans << endl;
}