#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const long long mod = 1e9 + 7;
const long long N = 2e5 + 5;
vector<long long> parent;
long long findparent(long long x) {
  if (x == parent[x]) return x;
  return parent[x] = findparent(parent[x]);
}
void unionnode(long long x, long long y) {
  parent[findparent(x)] = findparent(y);
}
int32_t main() {
  ios::sync_with_stdio(false);
  long long n, m, k;
  cin >> n >> m >> k;
  parent.resize(n);
  for (long long i = 0; i < n; i++) parent[i] = i;
  vector<long long> type;
  for (long long i = 0; i < k; i++) {
    long long c;
    cin >> c;
    while (c--) type.push_back(i);
  }
  vector<vector<long long> > dist(k, vector<long long>(k, INF));
  for (long long i = 0; i < m; i++) {
    long long a, b, c;
    cin >> a >> b >> c;
    a--;
    b--;
    if (c == 0) unionnode(a, b);
    dist[type[a]][type[b]] = min(dist[type[a]][type[b]], c);
    dist[type[b]][type[a]] = min(dist[type[b]][type[a]], c);
  }
  bool isok = true;
  for (long long i = 0; i < type.size() && isok; i++) {
    long long j = i;
    while (j < type.size() && type[j] == type[i]) {
      isok = isok && (findparent(i) == findparent(j));
      j++;
    }
    i = j - 1;
  }
  if (!isok) {
    cout << "No" << endl;
    return 0;
  }
  for (long long i = 0; i < k; i++) dist[i][i] = 0;
  cout << "Yes" << endl;
  for (long long h = 0; h < k; h++)
    for (long long i = 0; i < k; i++)
      for (long long j = 0; j < k; j++)
        if (dist[i][h] != INF && dist[h][j] != INF)
          dist[i][j] = min(dist[i][j], dist[i][h] + dist[h][j]);
  for (long long i = 0; i < k; i++) {
    for (long long j = 0; j < k; j++)
      cout << (dist[i][j] == INF ? -1 : dist[i][j]) << ' ';
    cout << endl;
  }
  return 0;
}
