#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int M = 2e5 + 10;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 998244353;
struct node {
  int head[N], ver[M], edge[M], Next[M];
  int tot;
  void add(int x, int y, int z) {
    ver[++tot] = y, edge[tot] = z, Next[tot] = head[x], head[x] = tot;
  }
} g1;
int cnt, lim;
int c[510];
int belong[N];
int d[510][510];
void dfs(int u) {
  belong[u] = cnt;
  for (int i = g1.head[u]; i; i = g1.Next[i]) {
    int v = g1.ver[i], w = g1.edge[i];
    if (w || belong[v] || v >= lim) {
      continue;
    }
    dfs(v);
  }
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 1; i <= k; i++) {
    cin >> c[i];
  }
  int u, v, w;
  for (int i = 1; i <= m; i++) {
    cin >> u >> v >> w;
    g1.add(u, v, w);
    g1.add(v, u, w);
  }
  for (int i = 1; i <= n; i += c[cnt]) {
    cnt++;
    lim = i + c[cnt];
    dfs(i);
  }
  bool flag = 1;
  for (int i = 1; i <= n; i++) {
    if (!belong[i]) {
      flag = 0;
      break;
    }
  }
  if (flag) {
    cout << "Yes" << endl;
    memset(d, inf, sizeof(d));
    for (int u = 1; u <= n; u++) {
      for (int i = g1.head[u]; i; i = g1.Next[i]) {
        int w = g1.edge[i], v = g1.ver[i];
        d[belong[u]][belong[v]] = min(d[belong[u]][belong[v]], w);
      }
    }
    for (int i = 1; i <= (k); i++) d[i][i] = 0;
    for (int l = 1; l <= k; l++) {
      for (int i = 1; i <= k; i++) {
        for (int j = 1; j <= k; j++) {
          d[i][j] = min(d[i][j], d[i][l] + d[l][j]);
        }
      }
    }
    for (int i = 1; i <= (k); i++) {
      for (int j = 1; j <= (k); j++) {
        if (d[i][j] == inf) {
          cout << "-1"
               << " ";
        } else {
          cout << d[i][j] << " ";
        }
      }
      cout << endl;
    }
  } else {
    cout << "No" << endl;
  }
  return 0;
}
