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; }
real readReal() { return readToken.to!real; }

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)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const M = readInt;
      const X = readLong;
      auto A = new long[N];
      auto B = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readLong;
        B[i] = readInt - 1;
      }
      const K = readInt;
      auto C = new int[K];
      foreach (k; 0 .. K) {
        C[k] = readInt;
      }
      
      auto ws = new long[N + 1];
      foreach (k; 0 .. K) {
        ++ws[C[k]];
      }
      foreach_reverse (j; 0 .. N) {
        ws[j] += ws[j + 1];
      }
      debug {
        writeln("ws = ", ws);
      }
      
      auto ims = new int[M];
      ims[] = -1;
      foreach (i; 0 .. N) {
        if (!~ims[B[i]] || A[ims[B[i]]] < A[i]) {
          ims[B[i]] = i;
        }
      }
      auto as = A.dup;
      foreach (i; 0 .. N) {
        if (ims[B[i]] == i) {
          as[i] += X;
        }
      }
      as.sort!"a > b";
      
      long ans;
      foreach (j; 0 .. N) {
        ans += ws[j + 1] * as[j];
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}