#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define M 1000000007
const int N=1e5+10;
int n,arr[N];
vector<string> gn;
map<string, int> mparr[N], look;
map<string, int>::iterator mit;
vector<LL> ans;

void createLook(int l, int r)
{
    look.clear();
    look=mparr[r];
    if(l==0) return ;
    string f; int s;
    for(mit=mparr[l-1].begin(); mit!=mparr[l-1].end(); mit++){
        f=mit->first; s = mit->second;
//        cout<<f<<" "<<s<<endl;
        if(look[f] - s !=0 )
            look[f] = look[f] - s;
        else{
            look.erase(f);
        }
    }

}

LL findOcc(string a , string b)
{
    LL ans=0;
    const char *aa = a.c_str();
    const char *bb= b.c_str();

    const char* pCurrent = strstr(aa,bb);
    while( pCurrent != NULL )
    {
        ans++;
        pCurrent++;
        pCurrent = strstr( pCurrent, bb);
   }
   return ans;

}

int main()
{
    ios_base::sync_with_stdio(0);
 //   freopen("ip.txt","r",stdin);
//    freopen("op.txt","w",stdout);
    cin>>n;
    string s;
    for(int i=0;i<n;i++){
        cin>>s;
        gn.push_back(s);
    }
    // cout<<gn.size()<<endl;
    for(int i=0;i<n;i++){
        cin>>arr[i];
    }

    mparr[0][gn[0]] = arr[0];
    for(int i=1;i<n;i++){
        mparr[i]=mparr[i-1];
        mparr[i][gn[i]] = mparr[i][gn[i]] + arr[i];
        // cout<<mparr[i].size()<<endl;
    }

    int q,l,r;
    cin>>q;

    while(q--){
        cin>>l>>r>>s;
        //cout<<l<<r<<s<<endl;
        createLook(l,r);
        // cout<<look.size()<<endl;
        LL ans_p=0;
        for(mit=look.begin(); mit!=look.end(); mit++){
            string f=mit->first; int sec = mit->second;
            // cout<<f<<" "<<s<<endl;
            LL occ = findOcc(s,f);
            ans_p = ans_p + occ*sec;
            ans.push_back(ans_p);
        }

    }


    return 0;
}
/