#include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;

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

ll gcd(ll n, ll m)
{
	ll tmp;
	while (m != 0)
	{
		tmp = n % m;
		n = m;
		m = tmp;
	}
	return n;
}

ll lcm(ll n, ll m)
{
	return abs(n) / gcd(n, m) * abs(m); //gl=xy
}

using namespace std;

#define int ll
void solve()
{
	ll d;
	cin>>d;
	vector<ll>c(26);
	rep(i,26)cin>>c[i];
	vector<vector<ll>>s(d,vector<ll>(26));
	rep(i,d)rep(j,26)cin>>s[i][j];
	vector<ll>t(d);
	rep(i,d)cin>>t[i];
	vector<ll>last(26);
	ll res=0;
	rep(i,d){
		ll maxv=0;
		t[i]--;
		// rep(j,26){
		// 	if(chmax(maxv,s[i][j]))day=j;
		// }
		maxv=s[i][t[i]];
		res+=maxv;
	}
	ll m;
	cin>>m;
	vector<ll>dd(m),q(m);
	rep(i,m){
		cin>>dd[i]>>q[i];
		dd[i]--;q[i]--;
		res-=s[dd[i]][t[dd[i]]];
		res+=s[dd[i]][q[i]];
		ll pre=res;
		// if(res<pre){
		// 	res=pre;
		// }
		t[dd[i]]=q[i];
		rep(k,d){
			last[t[k]]=k+1;
			rep(j,26){
				res-=c[j]*(k+1-last[j]);
			}
		}
		cout<<res<<"\n";
		rep(j,26)last[j]=0;
		res=pre;
	}
}
#undef int
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}
