#include <bits/stdc++.h>

#include <atcoder/all>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define FAST_IO                \
  ios::sync_with_stdio(false); \
  cin.tie(0);
const i64 INF = 1001001001001001001;
using Modint = atcoder::static_modint<998244353>;

i64 dijkstra(int K, vector<vector<pair<int, i64>>> &G) {
  int N = G.size();

  vector dist(N, vector(K + 1, INF));

  priority_queue<tuple<i64, int, int>, vector<tuple<i64, int, int>>, greater<>> pq;
  dist[0][0] = 0;
  pq.emplace(0, 0, 0);
  while (!pq.empty()) {
    auto [d, u, k] = pq.top();
    pq.pop();

    if (d > dist[u][k]) continue;
    for (auto [v, w] : G[u]) {
      if (dist[v][k] > d + w) {
        dist[v][k] = d + w;
        pq.emplace(dist[v][k], v, k);
      }

      if (k + 1 <= K) {
        if (dist[v][k + 1] > d) {
          dist[v][k + 1] = d;
          pq.emplace(dist[v][k + 1], v, k + 1);
        }
      }
    }
  }

  i64 ans = INF;
  for (int i = 0; i <= K; i++) {
    ans = min(ans, dist[N - 1][i]);
  }
  return ans;
}

int main() {
  FAST_IO
  auto ans = 0LL;

  int N, M, K;
  cin >> N >> M >> K;
  vector<i64> C(M);
  for (auto &c : C) {
    cin >> c;
  }
  vector<int> u(M), v(M);
  for (int i = 0; i < M; i++) {
    cin >> u[i] >> v[i];
    u[i]--;
    v[i]--;
  }

  vector<vector<pair<int, i64>>> G(N);
  for (int i = 0; i < M; i++) {
    G[u[i]].emplace_back(v[i], C[i]);
    G[v[i]].emplace_back(u[i], C[i]);
  }

  ans = dijkstra(K, G);
  if (ans >= INF / 2) {
    cout << -1 << endl;
    return 0;
  }
  cout << ans << endl;
}