#include <bits/stdc++.h>
using namespace std;
unsigned long long int MOD = 1000000007;
unsigned long long int B = 13331;
bool cmp(const int &a, const int &b) { return a < b; }
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int lcm(int a, int b) { return a * (b / gcd(a, b)); }
int n, m;
int whichk[100005];
int d[505][505];
int visi[100005];
vector<pair<int, int> > g[100005];
int cnt = 0;
void dfs(int v) {
  int i, j, k;
  if (visi[v] != -1) return;
  visi[v] = cnt;
  int x = g[v].size();
  for (i = 0; i < x; i++) {
    int to = g[v][i].first;
    dfs(to);
  }
}
int cover[505];
int main() {
  int i, j, k;
  cin >> n >> m >> k;
  for (i = 0; i < k + 2; i++)
    for (j = 0; j < k + 2; j++) d[i][j] = MOD;
  j = 1;
  memset(visi, -1, sizeof(visi));
  for (i = 1; i < k + 1; i++) {
    int c;
    cin >> c;
    cover[i] = c;
    int cnt = 0;
    while (cnt < c) {
      whichk[j] = i;
      ++j;
      ++cnt;
    }
  }
  for (i = 0; i < m; i++) {
    int x, y, z;
    cin >> x >> y >> z;
    if (z == 0) {
      g[x].push_back(make_pair(y, z));
      g[y].push_back(make_pair(x, z));
    }
    d[whichk[x]][whichk[y]] = min(d[whichk[x]][whichk[y]], z);
    d[whichk[y]][whichk[x]] = min(d[whichk[y]][whichk[x]], z);
  }
  for (i = 1; i < k + 1; i++) d[i][i] = 0;
  for (i = 1; i < n + 1; i++) {
    if (visi[i] == -1) {
      dfs(i);
      cnt++;
    }
  }
  bool flag = true;
  j = 1;
  for (i = 1; i < k + 1; i++) {
    int x;
    int ans = visi[j];
    for (x = j; x < j + cover[i]; x++)
      if (visi[x] != ans) flag = false;
    if (!flag) break;
    j += cover[i];
  }
  if (flag) {
    cout << "Yes";
    int x;
    for (x = 1; x < k + 1; x++)
      for (i = 1; i < k + 1; i++)
        for (j = 1; j < k + 1; j++) d[i][j] = min(d[i][j], (d[i][x] + d[x][j]));
    cout << endl;
    for (i = 1; i < k + 1; i++) {
      for (j = 1; j < k + 1; j++) {
        if (d[i][j] == MOD)
          cout << -1 << ' ';
        else
          cout << d[i][j] << ' ';
      }
      cout << endl;
    }
  } else
    cout << "No";
  return 0;
}
