#include <bits/stdc++.h>

#define ll long long
#define ldb long double
#define endl '\n'
#define For(i,l,r) for(int i=l;i<=r;i++)
#define ForD(i,r,l) for(int i=r;i>=l;i--)
#define REP(i,l,r) For(i,l,r-1)
#define PER(i,r,l) ForD(i,r-1,l)
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define All(x,n) x+1,x+1+n
#define Alll(x,n) x,x+n
#define sz(x) (signed)x.size()
#define unq(x) x.resize(unique(all(x))-x.begin())
#define mpa make_pair

#ifdef NCGM
#include"debug.h"
#else 
#define debug(...) "fr";
#endif

using namespace std;

const int SQRT=322,N=1e5+3;
int n,m,q,sm[2][322][322],sum[2][322];
int small[322],smSum=0;
int id[N],id1[N],deg[N],cnt=0;
int idx[322][322];
pair<int,int> ed[N];
bool del[N],state[N];
vector<int> g[N];

int find_edge(bool st,int v) {
    if (sum[st][v]==0) return -1;
    For(i,0,(m-1)/SQRT) 
        if (sm[st][v][i]>0) 
            For(j,i*SQRT+1,min((i+1)*SQRT,m)) 
                if (!del[j] && state[ed[j].ff]!=state[ed[j].ss]) return j;
    assert(false);   
    return -1;
}
int find_edge_small() {
    if (smSum==0) return -1;
    For(i,0,(m-1)/SQRT) 
        if (small[i]>0) 
            For(j,i*SQRT+1,min((i+1)*SQRT,m)) 
                if (!del[j] && state[ed[j].ff]!=state[ed[j].ss]) return j;
    // debug(smSum);
    // assert(false);
    return -1;
}
void dele(int rem) {
    del[rem]=1;
    if (deg[ed[rem].ff]>SQRT) {
        sm[!state[ed[rem].ss]][id[ed[rem].ff]][(rem-1)/SQRT]--;
        sum[!state[ed[rem].ss]][id[ed[rem].ff]]--;
    }
    if (deg[ed[rem].ss]>SQRT) {
        sm[!state[ed[rem].ff]][id[ed[rem].ss]][(rem-1)/SQRT]--;
        sum[!state[ed[rem].ff]][id[ed[rem].ss]]--;
    } else if (deg[ed[rem].ff]<=SQRT) {
        smSum--;
        small[(rem-1)/SQRT]--;
    }
}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> m;
    For(i,1,m) {
        cin >> ed[i].ff >> ed[i].ss;
        deg[ed[i].ff]++;
        deg[ed[i].ss]++;
        g[ed[i].ff].pb(i);
        g[ed[i].ss].pb(i);
    } 
    cin >> q;
    For(i,1,n) 
        if (deg[i]>SQRT) {
            id[i]=++cnt;
            id1[cnt]=i;
            For(j,1,m) 
                if (ed[j].ff==i ||ed[j].ss==i) sm[1][cnt][(j-1)/SQRT]++,sum[1][cnt]++;
        }
    For(i,1,m) 
        if (deg[ed[i].ff]>SQRT && deg[ed[i].ss]>SQRT) 
            idx[ed[i].ff][ed[i].ss]=idx[ed[i].ss][ed[i].ff]=i;
    For(qr,1,q) {
        char c;
        int u;
        cin >> c;
        if (qr==3) {
            // debug(sum[1][1]);
            // debug(find_edge(1,1));
        }
        if (c!='?') {
            cin >> u;
            bool ki=(c=='+');
            state[u]=ki;
            if (deg[u]>SQRT) {
                For(i,1,cnt) {
                    if (i==id[u] || idx[id[u]][i]==0) continue;
                    if (del[idx[id[u]][i]]) continue;
                    sum[!state[u]][i]++;
                    sum[state[u]][i]--;
                    sm[!state[u]][i][(idx[id[u]][i]-1)/SQRT]++;
                    sm[state[u]][i][(idx[id[u]][i]-1)/SQRT]--;
                }
            } else {
                for(auto ski: g[u]) {
                    if (del[ski]) continue;
                    int v=(ed[ski].ff==u?ed[ski].ss:ed[ski].ff);
                    if (deg[v]>SQRT) {
                        sum[!state[u]][id[v]]++;
                        sum[state[u]][id[v]]--;
                        sm[!state[u]][id[v]][(ski-1)/SQRT]++;
                        sm[state[u]][id[v]][(ski-1)/SQRT]--;
                    } else {
                        int emra=(state[u]==state[v]?-1:1);
                        smSum+=emra;
                        small[(ski-1)/SQRT]+=emra;
                    } 
                }
            }
        } else {
            int rem=find_edge_small();
            if (rem==-1) {
                For(i,1,cnt) {
                    rem=find_edge(state[id1[i]],i);
                    if (rem!=-1) break;
                }
            }   
            if(rem!=-1) {
                cout << rem << endl;
                dele(rem);
            } else cout << 0 << endl;
        }
    }
    return 0;
}