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

#define all(v) v.begin(),v.end()
using ll = long long;
using ull = unsigned long long;
using lll = __int128;
using vll=vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll,ll>;
using vp=vector<pair<ll, ll>>;
//using mint=modint1000000007;
//using mint=modint998244353;

const ll INF=1ll<<60;
ll mod10=1e9+7;
ll mod99=998244353;
const double PI = acos(-1);

#define rep(i,n) for (ll i=0;i<n;++i)
#define per(i,n) for(ll i=n-1;i>=0;--i)
#define rep2(i,a,n) for (ll i=a;i<n;++i)
#define per2(i,a,n) for (ll i=a;i>=n;--i)

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }

bool solve(){
   ll N,M;cin>>N>>M;
   vector<unordered_set<ll>> ab(N);
   rep(i,M){
      ll x,y;cin>>x>>y;
      x--;y--;
      ab[x].insert(y);
      ab[y].insert(x);
   }

   vll A(N);rep(i,N) cin>>A[i];
   vll sum(N);
   rep(i,N) for(auto x:ab[i]) sum[i]+=A[x];

   ll Q;cin>>Q;
   ll B=sqrt(M);
   vll P(Q);
   vll T(Q),U(Q),V(Q);
   for(int l=0;l<Q;l+=B){
      ll r=min(Q,l+B);
      rep2(i,l,r){
         cin>>T[i];
         if(T[i]==1){
            cin>>U[i]>>V[i];
            U[i]--;V[i]--;
            /**if(ab[U[i]].count(V[i])){
               ab[U[i]].insert(V[i]);
               ab[V[i]].insert(U[i]);
               P[i]=1;
            }else{
               ab[U[i]].erase(V[i]);
               ab[V[i]].erase(U[i]);
               P[i]=-1;
            }**/
         }else if(T[i]==2){
            cin>>U[i]>>V[i];
            U[i]--;
         }else{
            cin>>U[i];
            U[i]--;
            ll ans=sum[U[i]];
            unordered_map<ll,ll> mp;
            for(int j=l;j<i;j++){
               if(T[j]==1){



                  if(!ab[U[j]].count(V[j])){
                     ab[U[j]].insert(V[j]);
                     ab[V[j]].insert(U[j]);
                     P[j]=1;
                  }else{
                     ab[U[j]].erase(V[j]);
                     ab[V[j]].erase(U[j]);
                     P[j]=-1;
                  }



                  int to=-1;
                  if(U[j]==U[i]) to=V[j];
                  if(V[j]==U[i]) to=U[j];
                  if(to==-1) continue;
                  if(mp.count(to)) ans+=P[j]*mp[to];
                  else ans+=P[j]*A[to];
               }else if(T[j]==2){
                  if(ab[U[i]].count(U[j])){
                     if(mp.count(U[j])) ans+=V[j]-mp[U[j]];
                     else ans+=V[j]-A[U[j]];
                  }
                  mp[U[j]]=V[j];
               }
            }
            for(int j=i-1;j>=l;j--){
               if(T[j]==1){
                  if(!ab[U[j]].count(V[j])){
                     ab[U[j]].insert(V[j]);
                     ab[V[j]].insert(U[j]);
                  }else{
                     ab[U[j]].erase(V[j]);
                     ab[V[j]].erase(U[j]);
                  }
               }
            }
            cout<<ans<<"\n";
         }
      }
      rep2(i,l,r){
         if(T[i]==1){
            if(!ab[U[i]].count(V[i])){
               ab[U[i]].insert(V[i]);
               ab[V[i]].insert(U[i]);
            }else{
               ab[U[i]].erase(V[i]);
               ab[V[i]].erase(U[i]);
            }
         }else if(T[i]==2){
            A[U[i]]=V[i];
         }
      }
      rep(i,N) sum[i]=0;
      rep(i,N) for(auto x:ab[i]) sum[i]+=A[x];
      
   }
   return 0;
}




int main(){
   cin.tie(0);
   ios::sync_with_stdio(false);
   ll T=1;//cin>>T;
   rep(i,T) solve();
}