#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=2000; vll P(Q); vll T(Q),U(Q),V(Q); rep(i,Q){ cin>>T[i]; if(T[i]==1) cin>>U[i]>>V[i],U[i]--,V[i]--; else if(T[i]==2) cin>>U[i]>>V[i],U[i]--; else cin>>U[i],U[i]--; } for(ll l=0;l<Q;l+=B){ ll r=min(Q,l+B); unordered_set<ll> st;rep2(i,l,r) if(T[i]==3) st.insert(U[i]); 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]); sum[U[i]]+=A[V[i]]; sum[V[i]]+=A[U[i]]; }else{ ab[U[i]].erase(V[i]); ab[V[i]].erase(U[i]); sum[U[i]]-=A[V[i]]; sum[V[i]]-=A[U[i]]; } }else if(T[i]==2){ for(auto x:st) if(ab[U[i]].count(x)) sum[x]+=V[i]-A[U[i]]; A[U[i]]=V[i]; }else{ ll ans=sum[U[i]]; cout<<ans<<"\n"; } } 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(); }