import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


/*
  cost A[i] to flip [i, i+1)
  flip all ==> path from 0 to N
*/

enum INF = 10L^^18;

void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const M = readInt;
      const C = readLong;
      auto A = new long[N];
      foreach (u; 0 .. N) {
        A[u] = readLong;
      }
      auto L = new int[M];
      auto R = new int[M];
      foreach (i; 0 .. M) {
        L[i] = readInt - 1;
        R[i] = readInt;
      }
      
      alias Edge = Tuple!(long, "c", int, "v");
      auto G = new Edge[][N + 1];
      foreach (u; 0 .. N) {
        G[u] ~= Edge(A[u], u + 1);
        G[u + 1] ~= Edge(A[u], u);
      }
      foreach (i; 0 .. M) {
        G[L[i]] ~= Edge(C, R[i]);
        G[R[i]] ~= Edge(C, L[i]);
      }
      
      alias Entry = Tuple!(long, "c", int, "u");
      BinaryHeap!(Array!Entry, "a.c > b.c") que;
      auto dist = new long[N + 1];
      dist[] = INF;
      que.insert(Entry(dist[0] = 0, 0));
      for (; !que.empty; ) {
        const c = que.front.c;
        const u = que.front.u;
        que.removeFront;
        if (dist[u] == c) {
          foreach (e; G[u]) {
            const cc = c + e.c;
            const v = e.v;
            if (chmin(dist[v], cc)) {
              que.insert(Entry(cc, v));
            }
          }
        }
      }
      
      long ans = A.sum;
      ans -= dist[N];
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}