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

using namespace std;

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

struct Edge {
  int node;
  int length;
  int cap;

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

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

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

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

    int node, dist;

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

    if (vis[node])
      continue;

    vis[node] = true;
    minPath[root][node][minCap] = dist;

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

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

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

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

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

  int k, m;

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

  cell[1] = 1;
  for (int i = 2; i <= k + 1; i++)
    scanf("%d", &cell[i]);
  k++;

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

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

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

  for (int i = 1; i <= n; i++) {
    for (int minCap = 0; minCap <= k; minCap++)
      dijkstra_minPath(i, minCap);
  }

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

  for (int i = 1; i <= n; i++)
    dp[i][1] = minPath[1][i][0];

  for (int mask = 1; mask < (1 << k); mask++) {
    if (!(mask & 1))
      continue;

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

    for (int i = 1; i <= k; i++) {
      int node = cell[i];
      for (int byte = 1; byte < k; byte++) {
        if (mask & (1 << byte)) {
          for (int j = 1; j <= k; j++) {
            int _node;

            _node = cell[j];

            if (dp[_node][mask ^ (1 << byte)] != INF && minPath[_node][cell[byte + 1]][countBytes - 1] != INF && minPath[cell[byte + 1]][node][countBytes] != INF)
              dp[node][mask] = min(dp[node][mask], dp[_node][mask ^ (1 << byte)] + minPath[_node][cell[byte + 1]][countBytes - 1] * countBytes + minPath[cell[byte + 1]][node][countBytes] * (countBytes + 1));
          }
        }
      }
    }
  }

  int ans;

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

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