//package Hack101_46;

import java.util.Scanner;

public class Q3 {
	public void solve(){
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt(),i,health[]=new int[n];
		String gene[]=new String[n];
		for(i=0;i<n;i++)
			gene[i]=sc.next();
		for(i=0;i<n;i++)
			health[i]=sc.nextInt();
		int s=sc.nextInt(); //number of DNA strands
		long min=Long.MAX_VALUE,max=Long.MIN_VALUE,sum;
		while(s>0){
			int start=sc.nextInt(),end=sc.nextInt();
			String dna=sc.next();
			sum=0l;
			for(i=start;i<=end;i++){
					sum+=check(dna,gene[i],i,health);
			}
			if(sum>max)
				max=sum;
			else if(sum<min)
				min=sum;
			s--;
		}
		System.out.print(min+" "+max);
	}
	public long check(String dna,String gene,int pos,int[] health){
		int i,j,n=dna.length(),genLen=gene.length();
		long sum=0l;
		for(i=0;i<n;i++){
			if(dna.charAt(i)==gene.charAt(0)){
				for(j=1;j<genLen;j++)
					if(i+j<n && dna.charAt(i+j)!=gene.charAt(j))
						break;
				if(j==genLen)
					sum+=health[pos];			
			}
		}
		return sum;
	}
	public static void main(String[] args) {
		Q3 obj=new Q3();
		obj.solve();
	}
}