#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for (int i= a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (x).size()
#define int ll
#define F first
#define S second
#define PB push_back
#define MP make_pair
typedef long long int;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define endl '\n'
#define inf 3000000000000000000
#define random rand()^(rand()<<15)
mt19937 rnd(time(nullptr));

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, m1, q, a, b;
    cin >> n >> m1 >> q;
    vi d(n); vi m(n);
    vector<vi> g(n);
    vector<vi> gsq(n);
    vector<bool> sq(n);
    rep(i, 0, n) cin >> d[i];
    rep(i, 0, n) cin >> m[i];
    rep(i, 0, m1) {
        cin >> a >> b;
        g[--a].PB(--b);
        g[b].PB(a);
    }
    vector<int> stash(n);
    rep(i, 0, n) {
        sq[i] = sz(g[i]) >= sqrt(n);
        if (sq[i]) {
            stash[i] += d[i] - m[i];
            for (auto x: g[i]) {
                stash[i] += d[x] - m[x];
                gsq[x].PB(i);
            }
        }
    }
    rep(_, 0, q) {
        string s;
        cin >> s;
        int i;
        if (s[0] == 'a') {
            cin >> a >> s >> i;
            i--;
            if (s[0] == 'm') a *= -1;
            stash[i] += a;
            for (auto x: gsq[i]) {
                stash[x] += a;
            }
            d[i] += a;
        } else {
            cin >> i;
            i--;
            int r=0;
            if (sq[i]) {
                r = stash[i];
            } else {
                r += d[i] - m[i];
                for (auto x: g[i]) {
                    r += d[x] - m[x];
                }
            }
            if (r == 0) {
                cout << "same";
            } else if (r < 0) {
                cout << "monitors";
            } else {
                cout << "desks";
            }
            cout << endl;
        }
    }
    return 0;

    
}