#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template <typename V, typename T> void ndfill(V &x, const T &val) { x = val; }
template <typename V, typename T> void ndfill(vector<V> &vec, const T &val) { for (auto &v : vec) ndfill(v, val); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> srtunq(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << "(" << pa.first << "," << pa.second << ")"; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) { os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;

int D;
vector<int> C;
vector<vector<int>> S;

vector<int> schedule;
vector<vector<int>> prv, nxt;
int current_score;


vector<int> calc_score()
{
    vector<int> last(26, 0);
    vector<int> ret;
    FOR(d, 1, schedule.size())
    {
        current_score += S[d][schedule[d]];
        last[schedule[d]] = d;
        prv[d + 1][schedule[d]] = d;
        nxt[d - 1][schedule[d]] = d;
        REP(i, 26) current_score -= C[i] * (d - last[i]);
        ret.emplace_back(current_score);
    }
    REP(d, schedule.size()) REP(i, 26) chmax(prv[d + 1][i], prv[d][i]);
    IREP(d, schedule.size()) REP(i, 26) chmin(nxt[d][i], nxt[d + 1][i]);
    return ret;
}

void modify(int day, int contest)
{
    int cold = schedule[day];
    if (cold == contest) return;

    int dprv = prv[day][cold], dnxt = nxt[day][cold];
    nxt[dprv][cold] = dnxt;
    prv[dnxt][cold] = dprv;
    FOR(d, dprv + 1, dnxt) nxt[d][cold] = dnxt, prv[d][cold] = dprv;

    current_score -= C[cold] * (day - dprv) * (dnxt - day) + S[day][cold];

    schedule[day] = contest;

    dprv = prv[day][contest], dnxt = nxt[day][contest];
    nxt[day][contest] = dnxt, prv[day][contest] = dprv;
    FOR(d, dprv, day) nxt[d][contest] = day;
    FOR(d, day + 1, dnxt + 1) prv[d][contest] = day;

    current_score += C[contest] * (day - dprv) * (dnxt - day) + S[day][contest];
}

int main()
{
    cin >> D;

    C.resize(26);
    cin >> C;

    ndarray(S, D + 1, 26);
    REP(d, D) cin >> S[d + 1];

    ndarray(prv, D + 2, 26);
    ndfill(prv, 0);
    ndarray(nxt, D + 2, 26);
    ndfill(nxt, D + 1);


    schedule.resize(D + 1);
    REP(d, D) cin >> schedule[d + 1];
    for (auto &x : schedule) x--;
    calc_score();
    dbg(prv);
    dbg(nxt);

    int M;
    cin >> M;
    while (M--)
    {
        int d, q;
        cin >> d >> q;
        q--;
        // schedule[d] = q;
        // calc_score();
        modify(d, q);
        cout << current_score << '\n';
    }
}


Measured memory_bytes: 3772