#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>

using namespace std;

typedef long long Int;
typedef vector<int> vint;
typedef pair<int,int> pint;
#define mp make_pair

template<class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << " "; cout << endl; }
template<class T> void chmin(T &t, T f) { if (t > f) t = f; }
template<class T> void chmax(T &t, T f) { if (t < f) t = f; }
int in() { int x; scanf("%d", &x); return x; }

vector<pair<string,int> > kuji;

int main() {
	int n,m;
	while(cin>>n>>m,n){
		kuji.clear();
		string str;
		int buf,i;
		for(i=0;i<n;i++){
			cin>>str>>buf;
			kuji.push_back(mp(str,buf));
		}
		int j;
		int res=0;
		for(j=0;j<m;j++){
			cin>>str;
			for(i=0;i<n;i++){
				int k;
				bool ok=true;
				for(k=0;k<str.size();k++){
					if(kuji[i].first[k]!='*'&&kuji[i].first[k]!=str[k])ok=false;
				}
				if(ok)res+=kuji[i].second;
			}
		}
		cout<<res<<endl;
	}
	return 0;
}