#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
typedef pair<ld,ld> pld;

#define fi first
#define se second
#define pb push_back

 

#define ffor(i,n) for (int i=0;i <int(n);i++)  
#define sz(x) ((int) (x).size()) 
#define all(x) x.begin(),x.end()
const int sq = 450;

int del[100005];
int deg[100005];
int inset[100005];

int isbig[100005];
vector<int> vadj[100005];
vector<int> bigadj[100005];
int cnt[100005];
int eu[100005];
int ev[100005];
int bb[100005];
vector<int> se;
int type[100005];


set<int> big;
set<int> small;

set<int> mid0[100005];
set<int> mid1[100005];

void upd(int e, int i){
  if (i == 1) {
    if (type[e] == 1) {
      if (cnt[e] == 1) {
        if (small.find(e) != small.end())
        small.erase(e);
      }
      cnt[e]++;
      if (cnt[e] == 1) {
        if (!del[e])
        small.insert(e);
      }
    }

    else if (type[e] == 2) {
        if (mid0[bb[e]].find(e) != mid0[bb[e]].end())
        mid0[bb[e]].erase(e);
        if (!del[e])
        mid1[bb[e]].insert(e);
      
    }

    else if (type[e] == 3) {
      if (cnt[e] == 1) {
        if (big.find(e) != big.end())
        {big.erase(e);}
      }
      cnt[e]++;
      if (cnt[e] == 1) {
        if (!del[e])
        {big.insert(e);}
      }
    }
  }



  else {
    if (type[e] == 1) {
       if (cnt[e] == 1) {
        if (small.find(e) != small.end())
        small.erase(e);
      }
      cnt[e]--;
      if (cnt[e] == 1) {
        if (!del[e])
        small.insert(e);
      }
    }

    else if (type[e] == 2) {
      if (mid1[bb[e]].find(e) != mid1[bb[e]].end())
      mid1[bb[e]].erase(e);
      if (!del[e])
      mid0[bb[e]].insert(e);
    }

    else if (type[e] == 3) {
      if (cnt[e] == 1) {
        if (big.find(e) != big.end())
        big.erase(e);
      }
      cnt[e]--;
      if (cnt[e] == 1) {
        if (!del[e])
        big.insert(e);
      }
    }
  }

}




int main() {  
  ios_base::sync_with_stdio(false);  cin.tie(NULL);
   int n , m ; cin >> n >> m ;

   
   for (int i = 1  ; i <= m  ; i++) {
     int u , v; cin >> u >> v;

     deg[u]++;
     deg[v]++;

     vadj[u].pb(i);
     vadj[v].pb(i);

     eu[i] = u;
     ev[i] = v;



   }
   

  vector<int> vbig;

   for (int i = 1 ; i <= m ; i++) se.pb(i);
   for (int i = 1 ; i <= n ; i++) {
    if (deg[i] >= sq) {isbig[i] = 1;vbig.pb(i);}
   }
  
   

   for (int i = 1 ; i <= m ; i++) {

    if (isbig[eu[i]] && isbig[ev[i]]) {
      type[i] = 3;

      bigadj[eu[i]].pb(i);
      bigadj[ev[i]].pb(i);

    }
    else if (!isbig[eu[i]] && !isbig[ev[i]]) {
      type[i] = 1;
    }
    else {
      type[i] = 2;
      if (isbig[eu[i]]) bb[i] = eu[i]; else bb[i] = ev[i];
      mid0[bb[i]].insert(i);
    }

   }
  
    //for (int i = 1 ; i <= m ; i++) cout << type[i] << ' ' ;cout << '\n';


   int  q ; cin >> q;
   while (q--) {
     char t ; cin >> t;
     if (t == '+') {
        int id; cin >> id; 

        if (!isbig[id]) {
          for (auto e : vadj[id]) {
           
             upd(e,1);
          }
        }
        else {
          for (auto e : bigadj[id]) {
         
             upd(e,1);
          }
        }

        inset[id] = 1;
     }
     else if (t == '-') {
        int id; cin >> id;
        if (!isbig[id]) {
          for (auto e : vadj[id]) {
             upd(e,0);
          }
        }
        else {
          for (auto e : bigadj[id]) {
          
             upd(e,0);
          }
        }

        inset[id] = 0;
     }
     else {
        int ans = 0;
       
        if (!small.empty()) {
           ans = (*small.begin());small.erase(small.begin());
           del[ans] = 1;
        }
        else if (!big.empty()) {
           ans = (*big.begin());big.erase(big.begin());
           del[ans] = 1;
        }
        else {
          for (auto id : vbig) {
              if (ans != 0) break;
              
              if (inset[id]) {
                  if (!mid0[id].empty()) {
                    ans = (*mid0[id].begin());mid0[id].erase(mid0[id].begin());
                    del[ans] = 1;
                  }
              }
              else {
                  if (!mid1[id].empty()) {
                    ans = (*mid1[id].begin());mid1[id].erase(mid1[id].begin());
                    del[ans] = 1;
                  }
              }
          }
        }



      
        cout << ans << '\n';

     }
   }






  
}