/* #region Head */

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());

#define endl '\n'
#define sqrt sqrtl
#define floor floorl
#define log2 log2l

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T, typename U> ostream &operator<<(ostream &os, um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#define DEBUG_

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = true;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }

/* #endregion */

// Problem
void solve() {
    ll D;
    cin >> D;
    vll c(26);
    cin >> c;
    vvll s(D, vll(26));
    cin >> s;
    vll t(D); // 日程，[1, 26]
    cin >> t;
    REP(i, 0, D) t[i]--; // [0, 26) にする
    ll m;
    cin >> m;
    vll d(m), q(m);
    REP(i, 0, m) {
        cin >> d[i] >> q[i];
        d[i]--, q[i]--;
    }

    ll sat = 0;
    vll last(26, 0);
    vll contests = t;     // 各日のコンテスト種別
    vc<set<ll>> days(26); // 各コンテストが開催される日をセットで保持する
    REP(curDay, 0, D) {
        // day 日目 (0-indexed)
        ll curContestType = contests[curDay];
        last[curContestType] = curDay + 1;
        days[curContestType].insert(curDay);
        REP(contetType, 0, 26) sat -= (curDay + 1 - last[contetType]) * c[contetType];
        sat += s[curDay][curContestType];
        // cout << sat << endl;
    }

    REP(i, 0, m) {
        // クエリの処理
        ll targetDay = d[i], toContestType = q[i];
        ll fromContestType = contests[targetDay];
        // fromContestType で得していた分だけの満足度を引く
        // targetDay の前の開催日，後の開催日を取得する
        auto it = days[fromContestType].find(targetDay);
        ll delta_d1;
        if (it == days[fromContestType].begin()) {
            // 最初の開催
            delta_d1 = targetDay + 1;
        } else {
            auto itcp = it;
            itcp--;
            delta_d1 = targetDay - *itcp;
        }
        it++;
        ll delta_d2;
        if (it == days[fromContestType].end()) {
            // 最後の開催
            delta_d2 = D - targetDay;
        } else {
            delta_d2 = *it - targetDay;
        }
        sat -= (delta_d1 * c[fromContestType]) * delta_d2;
        sat -= s[targetDay][fromContestType];
        days[fromContestType].erase(targetDay);

        // toContestType にして得する分の満足度を足す
        auto it2 = days[toContestType].lower_bound(targetDay); // 次の開催
        ll delta_d2_2;
        if (it2 == days[toContestType].end()) {
            // 次の開催がなかった
            delta_d2_2 = D - targetDay;
        } else {
            delta_d2_2 = *it2 - targetDay;
        }
        ll delta_d1_2;
        if (it2 == days[toContestType].begin()) {
            // 前の開催がなかった
            delta_d1_2 = targetDay + 1;
        } else {
            it2--;
            delta_d1_2 = targetDay - *it2;
        }
        sat += (delta_d1_2 * c[toContestType]) * delta_d2_2;
        sat += s[targetDay][toContestType];
        days[toContestType].insert(targetDay);

        contests[targetDay] = toContestType;

        cout << sat << endl;
    }
}

// entry point
int main() {
    solve();
    return 0;
}


Measured memory_bytes: 4712