#include <bits/stdc++.h>
using namespace std;
long long mod(long long a, long long b) {
  if (a % b < 0) {
    return a % b + b;
  }
  return a % b;
}
long long mod_exp(long long a, long long b, long long c) {
  long long res = 1;
  a = a % c;
  while (b > 0) {
    if (b % 2 == 1) {
      res = (res * a) % c;
    }
    b /= 2;
    a = (a * a) % c;
  }
  return res;
}
long long mymod(long long a, long long b) { return ((a % b) + b) % b; }
bool prime[200001];
void SieveOfEratosthenes() {
  memset(prime, true, sizeof(prime));
  prime[1] = false;
  for (int p = 2; p * p <= 200000; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= 200000; i += p) prime[i] = false;
    }
  }
  return;
}
long long powe[200005];
void power() {
  powe[0] = 1;
  for (long long i = 1; i < 200005; i++) {
    powe[i] = mymod(2 * powe[i - 1], 998244353);
  }
}
long long gcdExtended(long long, long long, long long *, long long *);
long long modInverse(long long a, long long m) {
  long long x, y;
  long long g = gcdExtended(a, m, &x, &y);
  long long res = (x % m + m) % m;
  return res;
}
long long gcdExtended(long long a, long long b, long long *x, long long *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  long long x1, y1;
  long long gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
long long facto[200005];
void first() {
  facto[0] = 1;
  for (long long i = 1; i < 200005; i++) {
    facto[i] = mymod((i * facto[i - 1]), 998244353);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n;
  cin >> n;
  long long dist[301][301];
  for (long long i = 1; i < n + 1; i++) {
    for (long long j = 1; j < n + 1; j++) {
      cin >> dist[i][j];
    }
  }
  long long k;
  cin >> k;
  for (long long i = 0; i < k; i++) {
    long long a, b, c;
    long long ans = 0;
    cin >> a >> b >> c;
    for (long long i = 1; i < n + 1; i++) {
      for (long long j = 1; j < n + 1; j++) {
        dist[i][j] = ((dist[i][j] > dist[i][a] + c + dist[b][j])
                          ? dist[i][a] + c + dist[b][j]
                          : dist[i][j]);
        dist[i][j] = ((dist[i][j] > dist[i][b] + c + dist[a][j])
                          ? dist[i][b] + c + dist[a][j]
                          : dist[i][j]);
        ans += dist[i][j];
      }
    }
    cout << (ans / 2) << " ";
  }
  return 0;
}
