#include <bits/stdc++.h>
#include <unordered_map>
#define MAX 200000
#define ll long long

using namespace std;

int prefix_array(string pattern,string line){
    int j=0,count=0;
    int n=pattern.length();
    vector<int> v(n);
    v[0]=0;
    for(int i=1;i<n;i++){
        int j=v[i-1];
        while(j>0 && pattern[i]!=pattern[j])
            j=v[j-1];
        if(pattern[i]==pattern[j])
            j++;
        v[j]=j;
    }
    for(int i=0;i<line.length();i++){
        if(line[i]==pattern[j]){
            j++;
            if(j==pattern.length()){
                j=v[j-1];
                count++;
            }
        }
        else
            j=v[j];
    }
    v.clear();
    return count;
}

int main(){
    int n,s;
    cin>>n;
    int h[MAX];
    string g[MAX];
    unordered_map<string,int> myMap;
    for(int i=0;i<n;i++)
        cin>>g[i];
    for(int i=0;i<n;i++)
        cin>>h[i];
    cin>>s;
    int maximum=INT_MIN,minimum=INT_MAX;
    for(int i=0;i<s;i++){
        int first,last,sum=0;
        string d;
        cin>>first>>last>>d;
        for(int j=first;j<=last;j++){
            sum+=(h[j]*prefix_array(g[j],d));
        }
        maximum=max(maximum,sum);
        minimum=min(minimum,sum);
    }
    cout<<minimum<<" "<<maximum<<endl;
    return 0;
}