#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

const int INF = 1e9;
const ll LLINF = 4e18;
const double EPS = 1e-9;

void solve() {
    ll n,m,q;
    cin >> n >> m >> q;
    vector<ll> desks(n+1);
    vector<ll> monitors(n+1);
    vector<vector<ll>> adj(n+1, vector<ll>());
    for (ll i=1; i<=n; ++i) {
        cin >> desks[i];
    }
    for (ll i=1; i<=n; ++i) {
        cin >> monitors[i];
    }
    for (ll i=0; i<m; ++i) {
        ll a,b;
        cin >> a >> b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    for (ll i=0; i<q; ++i) {
        string s1;
        cin >> s1;
        if (s1 == "add") {
            ll n, lab;
            string s2;
            cin >> n >> s2 >> lab;
            if (s2 == "desk") {
                desks[lab] += n;
                continue;
            }
            monitors[lab] += n;
            continue;
        }
        ll lab;
        cin >> lab;
        ll total_monitors = monitors[lab];
        ll total_desks = desks[lab];
        for (ll neigh : adj[lab]) {
            total_monitors += monitors[neigh];
            total_desks += desks[neigh];
        }
        cout << (
            total_monitors == total_desks
            ? "same"
            : (
                total_monitors > total_desks
                ? "monitors"
                : "desks")
            ) << endl;
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
}