#include <iostream>

using namespace std;

int main()
{
    int n;
    cin>>n;
    string g[n]; int val[n];
    for(int i=0;i<n;i++)cin>>g[i];
    for(int i=0;i<n;i++)cin>>val[i];
    int q;
    cin>>q;long long minn=0, maxx=0;
    for(int i=0;i<q;i++)
    {
        int x, y;string d;
        cin>>x>>y>>d;long long point=0;string h=d;
        for(int k=x;k<=y;k++)
        {
            int pos = d.find(g[k]);
            while(pos!=-1)
            {
                point += val[k];
                d.erase(pos,1);
                pos = d.find(g[k]);
            }
            d=h;
        }
        maxx=max(maxx, point);
        minn=min(minn, point);
    }
    cout<<minn<< ' '<<maxx;
    return 0;
}