#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N, M, C;
    cin >> N >> M >> C;
    ll sum = 0;
    vector<vector<pair<int, int>>> G(N + 1);
    for (int i = 0; i < N; i++) {
        int A;
        cin >> A;
        sum += A;
        G[i].emplace_back(i + 1, A);
        G[i + 1].emplace_back(i, A);
    }
    for (; M--;) {
        int L, R;
        cin >> L >> R;
        L--;
        G[L].emplace_back(R, C);
        G[R].emplace_back(L, C);
    }

    vector<ll> dp(N + 1, IINF);
    priority_queue<pair<ll, int>> pq;
    dp[0] = 0;
    pq.emplace(-dp[0], 0);
    while (not pq.empty()) {
        auto [val, v] = pq.top();
        pq.pop();
        val *= -1;
        if (dp[v] < val) continue;
        for (auto [u, cost] : G[v]) {
            if (chmin(dp[u], val + cost)) {
                pq.emplace(-dp[u], u);
            }
        }
    }

    sum -= dp.back();
    cout << sum << '\n';
    return 0;
}