#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1510;
char g[N][N];
int c[N][N];
bool vis[N][N];
ll r[N],d[N],rcnt[N],dcnt[N];
int n;
ll sum(){
    ll s=0;
    for(int i=1;i<=n;i++) s+=rcnt[i]*r[i];
    for(int i=1;i<=n;i++) s+=dcnt[i]*d[i];
    return s;
}
void work(int i,int j){
    if(i==n&&j==n){
        if(g[i][j]=='D'){
            dcnt[j]++;
            if(vis[i][j]){
                if(c[i][j]<0) dcnt[0-c[i][j]]--;
                else rcnt[c[i][j]]--;
            }
            c[i][j]=0-j;
            vis[i][j]=true;
        }else{
            rcnt[i]++;
            if(vis[i][j]){
                if(c[i][j]<0) dcnt[0-c[i][j]]--;
                else rcnt[c[i][j]]--;
            }
            vis[i][j]=true;
            c[i][j]=i;
        }
    }else if(i==n||j==n){
        if(g[i][j]=='D'){
            if(i==n){
                dcnt[j]++;
                if(vis[i][j]){
                    if(c[i][j]<0) dcnt[0-c[i][j]]--;
                    else rcnt[c[i][j]]--;
                }
                vis[i][j]=true;
                c[i][j]=0-j;
            }else{
                if(vis[i][j]){
                    if(c[i][j]<0) dcnt[0-c[i][j]]--;
                    else rcnt[c[i][j]]--;
                }
                vis[i][j]=true;
                c[i][j]=c[i+1][j];
                if(c[i][j]<0) dcnt[0-c[i][j]]++;
                else rcnt[c[i][j]]++;
            }
        }else{
            if(j==n){
                if(vis[i][j]){
                    if(c[i][j]<0) dcnt[0-c[i][j]]--;
                    else rcnt[c[i][j]]--;
                }
                rcnt[i]++;
                c[i][j]=i;
                vis[i][j]=true;
            }else{
                if(vis[i][j]){
                    if(c[i][j]<0) dcnt[0-c[i][j]]--;
                    else rcnt[c[i][j]]--;
                }
                c[i][j]=c[i][j+1];
                vis[i][j]=true;
                if(c[i][j]<0) dcnt[0-c[i][j]]++;
                else rcnt[c[i][j]]++;
            }
        }
    }else{
        if(g[i][j]=='D'){
            if(vis[i][j]){
                if(c[i][j]<0) dcnt[0-c[i][j]]--;
                else rcnt[c[i][j]]--;
            }
            vis[i][j]=true;
            c[i][j]=c[i+1][j];
            if(c[i][j]<0) dcnt[0-c[i][j]]++;
            else rcnt[c[i][j]]++;
        }else{
            if(vis[i][j]){
                if(c[i][j]<0) dcnt[0-c[i][j]]--;
                else rcnt[c[i][j]]--;
            }
            c[i][j]=c[i][j+1];
            vis[i][j]=true;
            if(c[i][j]<0) dcnt[0-c[i][j]]++;
            else rcnt[c[i][j]]++;
        }
    }
    return;
}
int main()
{
    freopen("zunxun.in","r",stdin);
    freopen("zunxun.out","w",stdout);
    
    cin>>n;
    for(int i=1;i<=n;i++){
        string s;
        cin>>s;
        s=" "+s;
        for(int j=1;j<=n;j++) g[i][j]=s[j];
        cin>>r[i];
    }
    for(int i=1;i<=n;i++) cin>>d[i];
    for(int i=n;i>=1;i--) for(int j=n;j>=1;j--) work(i,j);
    cout<<sum()<<endl;
    int q;
    cin>>q;
    while(q--){
        int x,y;
        cin>>x>>y;
        if(g[x][y]=='R') g[x][y]='D';
        else g[x][y]='R';
        for(int i=x;i>=1;i--) for(int j=y;j>=1;j--) work(i,j);
        cout<<sum()<<endl;
    }
    return 0;
}