program aa;
var
b,c,d,e,i,j,k,n,max,sum:longint;
t:array[1..100000]of string;
a:array[1..100000]of longint;
s:string;
f1,f2:text;
//********************************************
    procedure sort(l,r: longint);
      var
         i,j: longint;
         x,y:longint;
         fff:string;
      begin
         i:=l;
         j:=r;
         x:=a[(l+r) div 2];
         repeat
           while a[i]<x do
            inc(i);
           while x<a[j] do
            dec(j);
           if not(i>j) then
             begin
                fff:=t[i];
                t[i]:=t[j];
                t[j]:=fff;
                y:=a[i];
                a[i]:=a[j];
                a[j]:=y;

                inc(i);
                j:=j-1;
             end;
         until i>j;
         if l<j then
           sort(l,j);
         if i<r then
           sort(i,r);
      end;
//********************************************
begin
 assign(f1,'star.in');
 assign(f2,'star.out');
 reset(f1);
 rewrite(f2);
 readln(f1,k);
 for i:=1 to k do
  readln(f1,t[i]);
  readln(f1,n);
 for i:=1 to n do
 begin
  readln(f1,s);
  readln(f1,b);
  for j:=1 to k do
   if t[j]=s then begin a[j]:=a[j]+b; break; end;
 end;
 sort(1,k);
 for i:=k downto 1 do
 begin
  writeln(f2,t[i]);
  writeln(f2,a[i]);
 end;
 close(f1);close(f2);
 end.