#include <bits/stdc++.h>

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

	int N, M, C;
	long long S = 0;
	std::cin >> N >> M >> C;
	std::vector<std::vector<std::pair<int, int>>> graph(N + 1);
	
	for (int i = 0, v; i < N; i++) {
	  std::cin >> v, S += v;
	  graph[i].emplace_back(i + 1, v);
	  graph[i + 1].emplace_back(i, v);
	}
	
	for (int i = 0, l, r, v; i < M; i++) {
	  std::cin >> l >> r, l--;
	  graph[l].emplace_back(r, C);
	  graph[r].emplace_back(l, C);
	}
	
	std::vector<bool> vis(N + 1);
	std::vector<long long> dist(N + 1, LLONG_MAX);
	std::priority_queue<std::pair<long long, int>> pq;
	pq.emplace(dist[0] = 0, 0);
	while (!pq.empty()) {
	  int u = pq.top().second;
	  pq.pop();
	  if (vis[u]) { continue; }
	  vis[u] = true;
	  for (auto t: graph[u]) {
	    int v, w;
	    std::tie(v, w) = t;
	    if (dist[u] + w < dist[v]) { pq.emplace(-(dist[v] = dist[u] + w), v); }
	  }
	}
	std::cout << S - dist[N] << '\n';

  return 0;
}

/*
g++ card.cpp -o card -std=c++14 -O2 -Wl,--stack=999999999 -Wall -Wextra && card
*/