#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>

using namespace std;

#define Rep(i,a,b) for(ll i = a; i < b; ++i)
#define rep(i,b) Rep(i,0,b)
#define allof(a) (a).begin(), (a).end()

#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")

using ll = long long;

constexpr int inf = 1e9 + 7;
constexpr ll infll = 1ll << 60ll;
constexpr ll mod = 1e9 + 7;
// 0~3までは右下左上 4~7までは斜め
constexpr int dx[] = { 1, 0, -1, 0, 1, -1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1 };

namespace {
    template<typename T> bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
    template<typename T> bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

    void Cout(long long x, const char* end = "\n") { std::cout << x << end; }
    template <typename T> void Cout(const T& x, const char* end = "\n") { std::cout << x << end; }
    template <typename T> void Cout(const std::vector<T>& x, const char* sep = " ", const char* end = "\n") { for (std::size_t i = 0, sz = x.size(); i < sz; ++i) { std::cout << x[i] << (i == sz - 1 ? end : sep); } }

    // 標準入出力
    struct inp {
        std::size_t szi, szj;
        inp(std::size_t _szi = 1, std::size_t _szj = 1) : szi(_szi), szj(_szj) {}
        template <typename T> operator T () const { T a; std::cin >> a; return a; }
        template <typename T> operator std::vector<T>() const { std::vector<T> a(szi); for (std::size_t i = 0; i < szi; ++i) std::cin >> a[i]; return a; }
        template <typename T> operator std::vector<std::vector<T>>() const {
            std::vector<std::vector<T>> a(szi, std::vector<T>(szj));
            for (std::size_t i = 0; i < szi; ++i) for (std::size_t j = 0; j < szj; ++j) cin >> a[i][j]; return a;
        }
    };
    inp inp1;

    //int score_down[26]; // 満足度の下がりやすさ
    //int score_up[365][26]; // 満足度の増加数
    //int contest[365]; // コンテストのタイプ
    //int last[26];

    int d = 365;

    int CalcScore(vector<int>& score_down, vector<vector<int>>& score_up, vector<int>& contest) {
        int score = 0;
        vector<int> last(26, -1);
        rep(i, d) {
            int type = contest[i] - 1;
            // 満足度の増加
            score += score_up[i][type];
            last[type] = i;
            // 時間による満足度の低下
            rep(j, 26) {
                score -= score_down[j] * (i - last[j]);
            }
        }
        return score;
    }
}

int main() {
    srand((unsigned)time(NULL));

    cin >> d;
    vector<int> score_down = inp(26);
    vector<vector<int>> score_up = inp(d, 26);
    vector<int> contest = inp(d);

    int m = inp1;

    rep(i, m) {
        int d, q;
        cin >> d >> q;
        --d;
        int tmp = contest[d];
        contest[d] = q;
        Cout(CalcScore(score_down, score_up, contest));
        //contest[d] = tmp;
    }

    return 0;
}


Measured memory_bytes: 3684