//#define _GLIBCXX_DEBUG

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

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T1, typename T2>
bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};
vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2>&p){
  return os << p.first << " " << p.second;
}
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
vector<vector<ll>>s;
vector<ll>c;
ll d;
struct Score{
  vector<ll>t;
  ll now;
  vector<set<ll>>st;
  Score(vector<ll>t):t(t){
    now=scoring();
    st.resize(26);
    rep(i,0,26){
      st[i].insert(-1);
      st[i].insert(d);
    }
    //debug(c,c.size());
    //debug(s,d,26);
    //debug(t,d);
    rep(i,0,d)st[t[i]].insert(i);
  }
  ll scoring(){
    ll ret=0;
    vector<ll>last(26,-1);
    rep(i,0,d){
      ret+=s[i][t[i]];
      last[t[i]]=i;
      rep(j,0,26)ret-=c[j]*(i-last[j]);
      //cout<<ret<<endl;
    }
    return ret;
  }
  void update(ll idx,ll y){
    ll x=t[idx];
    auto pre=*prev(st[x].find(idx));
    now+=f(idx-pre)*c[x];
    auto nxt=*next(st[x].find(idx));
    //cout<<x spa  pre spa idx spa nxt<<endl;
    //cout<<f(nxt-idx) spa f(idx-pre) spa f(nxt-pre)<<endl;
    now+=f(nxt-idx)*c[x];
    now-=f(nxt-pre)*c[x];
    now-=s[idx][x];
    st[x].erase(idx);
    st[y].insert(idx);
    pre=*prev(st[y].find(idx));
    nxt=*next(st[y].find(idx));
    //cout<<y spa pre spa idx spa nxt spa f(nxt-pre)<<endl;
    now+=f(nxt-pre)*c[y];
    now-=f(idx-pre)*c[y];
    now-=f(nxt-idx)*c[y];
    now+=s[idx][y];
    t[idx]=y;
  }
  ll f(ll x){
    //cout<<x spa x*(x-1)/2 spa x*(x+1)/2<<endl;
    return x*(x-1)/2;
  }
};
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  cin>>d;
  ll num=26;
  c.resize(num);
  rep(i,0,num)cin>>c[i];
  s=vec(d,num,0LL);
  rep(i,0,d)rep(j,0,num)cin>>s[i][j];
  vector<ll>t(d);
  rep(i,0,d)cin>>t[i],t[i]--;
  Score sc(t);
  //cout<<sc.now<<endl;
  ll q;cin>>q;
  while(q--){
    ll d,q;cin>>d>>q;d--;q--;
    sc.update(d,q);
    cout<<sc.now<<endl;
  }
  return 0;
}

Measured memory_bytes: 3784