#line 1 "main.cpp"

/**
 * @title Template
 */

#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <cassert>
#include <set>

#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/chmin_chmax.cpp"

template <class T, class U>
constexpr bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) { lhs = rhs; return true; }
  return false;
}

template <class T, class U>
constexpr bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) { lhs = rhs; return true; }
  return false;
}

/**
 * @title Chmin/Chmax
 */
#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp"

#line 4 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp"

class range {
public:
  class iterator {
  private:
    int64_t M_position;

  public:
    constexpr iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { ++M_position; }
    constexpr bool operator != (iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }
  };

  class reverse_iterator {
  private:
    int64_t M_position;
  
  public:
    constexpr reverse_iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { --M_position; }
    constexpr bool operator != (reverse_iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }
  };
  
private:
  const iterator M_first, M_last;

public:
  constexpr range(int64_t first, int64_t last) noexcept: M_first(first), M_last(std::max(first, last)) { }
  constexpr iterator begin() const noexcept { return M_first; }
  constexpr iterator end() const noexcept { return M_last; }
  constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator(*M_last - 1); } 
  constexpr reverse_iterator rend() const noexcept { return reverse_iterator(*M_first - 1); } 
};

/**
 * @title Range
 */
#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/rev.cpp"

#include <type_traits>
#include <iterator>
#line 6 "/Users/kodamankod/Desktop/cpp_programming/Library/other/rev.cpp"

template <class T>
class rev_impl {
public:
  using iterator = decltype(std::rbegin(std::declval<T>()));

private:
  const iterator M_begin;
  const iterator M_end;

public:
  constexpr rev_impl(T &&cont) noexcept: M_begin(std::rbegin(cont)), M_end(std::rend(cont)) { }
  constexpr iterator begin() const noexcept { return M_begin; }
  constexpr iterator end() const noexcept { return M_end; }
};

template <class T>
constexpr decltype(auto) rev(T &&cont) {
  return rev_impl<T>(std::forward<T>(cont));
}

/**
 * @title Reverser
 */
#line 18 "main.cpp"

using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;

constexpr i32 inf32 = (i32(1) << 30) - 1;
constexpr i64 inf64 = (i64(1) << 62) - 1;

int main() {
  size_t D;
  std::cin >> D;
  std::array<i32, 26> lose{};
  for (auto &x: lose) {
    std::cin >> x;
  }
  std::vector<std::array<i32, 26>> get(D);
  for (auto &arr: get) {
    for (auto &x: arr) {
      std::cin >> x;
    }
  }
  std::array<std::set<i32>, 26> used{};
  for (auto &set: used) {
    set.insert(0);
    set.insert(D + 1);
  }
  i32 score = 0;
  std::vector<i32> select(D);
  for (auto i: range(0, D)) {
    std::cin >> select[i];
    --select[i];
    used[select[i]].insert(i + 1);
    score += get[i][select[i]];
  }
  const auto decrease = [&](const i32 loss, const auto itr) {
    const auto len = *itr - *std::prev(itr) - 1;
    return loss * (len * (len + 1) / 2);
  };
  for (auto i: range(0, 26)) {
    const auto &set = used[i];
    for (auto itr = std::next(set.begin()); itr != set.end(); ++itr) {
      score -= decrease(lose[i], itr);
    }
  }
  i32 Q;
  std::cin >> Q;
  while (Q--) {
    i32 d, q;
    std::cin >> d >> q;
    --d; --q;
    score -= get[d][select[d]];
    score += get[d][q];
    {
      auto itr = used[select[d]].find(d + 1);
      score += decrease(lose[select[d]], itr);
      score += decrease(lose[select[d]], std::next(itr));
      itr = used[select[d]].erase(itr);
      score -= decrease(lose[select[d]], itr);
    }
    {
      auto itr = used[q].lower_bound(d + 1);
      score += decrease(lose[q], itr);
      itr = used[q].insert(d + 1).first;
      score -= decrease(lose[q], itr);
      score -= decrease(lose[q], std::next(itr));
    }
    select[d] = q;
    std::cout << score << '\n';
  }
  return 0;
}


Measured memory_bytes: 3692