#include<cstdio>
#define N 1505
#define ll long long
using namespace std;
int n,q,x,y,f[N][N],c[N][2],sum;bool b[N][N];char s[N];
void dfs(int i,int j,int k)
{
    while(i!=n+1&&j!=n+1)
    {
        if(b[i][j])i++;
        else j++;
        f[i][j]+=k;
    }
}
int read(){
    int sum=0;bool f=0;char c=getchar();
    for(;c<48||c>57;c=getchar())if(c==45)f=1;
    for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
    return f?-sum:sum;
}
int main(){
    freopen("zunxun.in","r",stdin);freopen("zunxun.out","w",stdout);
    n=read();
    for(int i=1;i<=n;i++)
    {
        scanf("%s",s+1);
        for(int j=1;j<=n;j++)b[i][j]=s[j]^'R';
        c[i][0]=read();
    }
    for(int i=1;i<=n;i++)c[i][1]=read();
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
        {
            f[i][j]++;
            if(b[i][j])
                f[i+1][j]+=f[i][j];
            else
                f[i][j+1]+=f[i][j];
        }
    for(int i=1;i<=n;i++)sum+=f[i][n+1]*c[i][0]+f[n+1][i]*c[i][1];
    printf("%d\n",sum);
    q=read();
    while(q--)
    {
        x=read();y=read();
        dfs(x,y,-f[x][y]);
        b[x][y]=!b[x][y];
        dfs(x,y,f[x][y]);
        sum=0;
        for(int i=1;i<=n;i++)sum+=f[i][n+1]*c[i][0]+f[n+1][i]*c[i][1];
        printf("%d\n",sum);
    }
    return 0;
}