#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
struct hehe
{
	char name[100];
	long long mark;
}q[100001];
int cmp(const void*a,const void*b);
bool check(int x);
int n,m,lq;
char s[100];
int main()
{
	freopen ("star.in","r",stdin);
	freopen ("star.out","w",stdout);
	scanf("%d\n",&n);
	for (int p=0;p<n;p++)
	{
		scanf("%[^\n]\n",&q[p].name);  
		q[p].mark=0;
	}
	scanf("%d\n",&m);
	for (int i=0;i<m;i++)
	{
		scanf("%[^\n]\n",&s);  
		lq=strlen(s);
		int temp;
		for (int j=0;j<n;j++)
		{
			if (check(j))
			{
				temp=j;
				break;
			}
		}
		int number;
		scanf("%d\n",&number);
		q[temp].mark+=number;
	}
	qsort(q,n,sizeof(q[0]),cmp);
	for (int i=0;i<n;i++)
	{
		cout<<q[i].name<<endl<<q[i].mark<<endl;
	}
	return 0;
}
bool check(int x)
{
	int lw;
	lw=strlen(q[x].name);
	if (lw!=lq)
	{
		return false;
	}
	for (int p=0;p<lq;p++)
	{
		if (q[x].name[p]!=s[p])
		{
			return false;
		}
	}
	return true;
}
int cmp(const void*a,const void*b)
{
	struct hehe*c=(struct hehe*)a;
	struct hehe*d=(struct hehe*)b;
	return d->mark- c->mark;
}