#include <cstdio>
#include <vector>
#include <queue>

using namespace std;

const long long MAX_K = 16;
const long long MAX_N = 750;
const long long INF = 0x7fffffff;

struct Edge {
  long long node;
  long long length;
  long long cap;

  bool operator <(const Edge &other) const {
    return this->length > other.length;
  }
};

long long n;
long long cell[1 + MAX_K];
long long getCon[1 + MAX_N];
vector<Edge> g[1 + MAX_N];
long long minPath[1 + MAX_K][1 + MAX_K][1 + MAX_K];
bool vis[MAX_N];
long long dp[1 + MAX_K][1 + (1 << MAX_K)];

void dijkstra_minPath(long long root, long long minCap) {
  priority_queue<Edge> pq;

  pq.push({root, 0});
  while (!pq.empty()) {
    Edge temp = pq.top();
    pq.pop();

    long long node, dist;

    node = temp.node;
    dist = temp.length;

    if (vis[node])
      continue;

    vis[node] = true;
    if (getCon[node] != 0)
      minPath[getCon[root]][getCon[node]][minCap] = dist;

    for (auto e : g[node]) {
      long long u, l, cap;

      u = e.node;
      l = e.length;
      cap = e.cap;

      if (!vis[u] && cap >= minCap)
        pq.push({u, dist + l});
    }
  }

  for (long long i = 1; i <= n; i++)
    vis[i] = false;
}

int main() {
  freopen("gather.in", "r", stdin);
  freopen("gather.out", "w", stdout);

  long long k, m;

  scanf("%lld%lld%lld", &k, &n, &m);

  cell[1] = 1;
  getCon[1] = 1;
  for (long long i = 2; i <= k + 1; i++) {
    scanf("%lld", &cell[i]);
    getCon[cell[i]] = i;
  }
  k++;

  for (long long i = 1; i <= m; i++) {
    long long u, v, l, c;

    scanf("%lld%lld%lld%lld", &u, &v, &l, &c);
    g[u].push_back({v, l, c});
    g[v].push_back({u, l, c});
  }

  for (long long i = 1; i <= k; i++) {
    for (long long j = 1; j <= k; j++) {
      for (long long minCap = 0; minCap <= k - 1; minCap++)
        minPath[i][j][minCap] = INF;
    }
  }

  for (long long i = 1; i <= k; i++) {
    for (long long minCap = 0; minCap <= k - 1; minCap++)
      dijkstra_minPath(cell[i], minCap);
  }

  for (long long i = 1; i <= k; i++) {
    for (long long mask = 0; mask < (1 << k); mask++)
      dp[i][mask] = INF;
  }

  for (long long i = 1; i <= k; i++)
    dp[i][1] = minPath[1][i][0];

  for (long long mask1 = 0; mask1 < (1 << (k - 1)); mask1++) {
    long long mask = mask1 * 2 + 1;
    if (!(mask & 1))
      continue;

    long long countBytes = 0;
    for (long long byte = 1; byte < k; byte++) {
      if (mask & (1 << byte))
        countBytes++;
    }

    for (long long i = 2; i <= k; i++) {
      for (long long byte = 1; byte < k; byte++) {
        if (mask & (1 << byte)) {
          for (long long j = 2; j <= k; j++) {
            if (dp[j][mask ^ (1 << byte)] != INF && minPath[j][byte + 1][countBytes - 1] != INF && minPath[byte + 1][i][countBytes] != INF)
              dp[i][mask] = min(dp[i][mask], dp[j][mask ^ (1 << byte)] + minPath[j][byte + 1][countBytes - 1] * countBytes + minPath[byte + 1][i][countBytes] * (countBytes + 1));
          }
        }
      }
    }
  }

  long long ans;

  ans = INF;
  for (long long i = 2; i <= k; i++)
    ans = min(ans, dp[i][(1 << k) - 1]);

  printf("%lld\n", ans);
  return 0;
}