N,M,Q=map(int,input().split())

Dsdsd = list(map(int,input().split()))
Msdsd = list(map(int,input().split()))

neighbors = [[i] for i in range(N)]

for _ in range(M):
    f,t=map(int,input().split())
    neighbors[f-1].append(t-1)
    neighbors[t-1].append(f-1)

monitors = [0 for _ in range(N)]
desks = [0 for _ in range(N)]
for i in range(N):
    monitors[i] = sum(Msdsd[j] for j in neighbors[i])
    desks[i] = sum(Dsdsd[j] for j in neighbors[i])

for _ in range(Q):
    q=input().split()
    if q[0] == 'add':
        if q[2] == 'monitor':
            for j in neighbors[int(q[3])-1]:
                monitors[j] += int(q[1])
        else:
            for j in neighbors[int(q[3])-1]:
                desks[j] += int(q[1])
    else:
        i=int(q[1])-1
        m=monitors[i]
        d=desks[i]
        if m==d:
            print('same')
        elif m<d:
            print('desks')
        else:
            print('monitors')