#include <stdio.h>
#include <stdlib.h>
#include <string.h>

typedef struct 
{
	char s[20];
	int val;
	int id;
} Node;

Node nd[1001];
int N;

int cp(const void *a, const void *b)
{
	Node *aa = (Node *)a;
	Node *bb = (Node *)b;
	return strcmp(aa->s, bb->s);
}

int main()
{
	int T, ans, i, val;
	Node key, *pkey;
	scanf("%d %d", &N, &T);
	for (i = 0; i < N; i++)
	{
		scanf("%s %d", nd[i].s, &nd[i].val);
		nd[i].id = i;
	}
	qsort(nd, N, sizeof(nd[0]), cp);
	while (T--)
	{
		val = 0;
		while (scanf("%s", key.s) != -1 && strcmp(key.s, "."))
		{
			pkey = (Node *)bsearch(&key, nd, N, sizeof(nd[0]), cp);
			if (pkey != NULL)
			{
				val += pkey->val;
			}
		}
		printf("%d\n", val);
	}
	return 0;
}