#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;
// const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

using BIT = bitset< 366 >;

int main() {
  int D; // D: 365
  cin >> D;
  vector< int > C(26);
  cin >> C;
  auto S = make_v< int >(D, 26);
  cin >> S;

  vector< int > T(D);
  cin >> T;
  for(auto &p : T) --p;


  int ret = 0;
  vector< int > last(26, -1);
  vector< BIT > bit(26), bit_rev(26);
  for(int i = 0; i < 26; i++) {
    bit[i].set(D);
    bit_rev[i].set(D);
  }
  for(int i = 0; i < D; i++) {
    last[T[i]] = i;
    bit[T[i]].set(i);
    bit_rev[T[i]].set(D - 1 - i);
    ret += S[i][T[i]];
    for(int j = 0; j < 26; j++) ret -= C[j] * (i - last[j]);
  }
  int M;
  cin >> M;
  while(M--) {
    int d, q;
    cin >> d >> q;
    --d, --q;


    ret -= S[d][T[d]];
    int pre_diff = (int) bit_rev[T[d]]._Find_next(D - 1 - d) - (D - 1 - d);
    int nxt_diff = (int) bit[T[d]]._Find_next(d) - d;
    ret -= pre_diff * nxt_diff * C[T[d]];
    bit[T[d]].reset(d);
    bit_rev[T[d]].reset(D - 1 - d);
    T[d] = q;
    ret += S[d][T[d]];
    bit[T[d]].set(d);
    bit_rev[T[d]].set(D - 1 - d);
    pre_diff = (int) bit_rev[T[d]]._Find_next(D - 1 - d) - (D - 1 - d);
    nxt_diff = (int) bit[T[d]]._Find_next(d) - d;
    ret += pre_diff * nxt_diff * C[T[d]];

    cout << ret << "\n";
  }
}



Measured memory_bytes: 3700