#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pi;
typedef pair<ll,pi> ppi;
typedef pair<ll,ppi> pppi;
typedef pair<ll,pppi> ppppi;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
/*
#include<boost/multiprecision/cpp_int.hpp>
namespace mp=boost::multiprecision;
using Bint=mp::cpp_int;
*/
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
const ld EPS=1e-8;
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
int main(){
  ll N,M;cin>>N>>M;
  vector<set<ll>>E(N);
  REP(i,M){
  	ll u,v;cin>>u>>v;u--;v--;
  	E[u].insert(v);
  	E[v].insert(u);
  }
  vi A(N);cin>>A;
  const ll B=320;
  vi sum(N);
  REP(i,N)if(sz(E[i])>=B)for(auto j:E[i])sum[i]+=A[j];
  vector<set<ll>>BE(N);
  REP(i,N)for(auto j:E[i])if(sz(E[j])>=B)BE[i].insert(j);
  ll Q;cin>>Q;
  while(Q--){
  	ll t;cin>>t;
  	if(t==1){
  		ll u,v;cin>>u>>v;u--;v--;
  		if(E[u].count(v)){
  			E[u].erase(v);
  			E[v].erase(u);
  			if(sz(E[u])==B-1){
  				sum[u]=0;
  				for(auto v:E[u])BE[v].erase(u);
  				BE[v].erase(u);
  			}
  			if(sz(E[v])==B-1){
  				sum[v]=0;
  				for(auto u:E[v])BE[u].erase(v);
  				BE[u].erase(v);
  			}
  			if(sz(E[u])>=B)BE[v].erase(u),sum[u]-=A[v];
  			if(sz(E[v])>=B)BE[u].erase(v),sum[v]-=A[u];
   		}
  		else{
  			E[u].insert(v);
  			E[v].insert(u);
  			if(sz(E[u])==B){
  				sum[u]=0;
  				for(auto v:E[u])sum[u]+=A[v],BE[v].insert(u);
  			}
  			if(sz(E[v])==B){
  				sum[v]=0;
  				for(auto u:E[v])sum[v]+=A[u],BE[u].insert(v);
  			}
  			if(sz(E[u])>B)BE[v].insert(u),sum[u]+=A[v];
  			if(sz(E[v])>B)BE[u].insert(v),sum[v]+=A[u];
  		}
  	}
  	else if(t==2){
  		ll i,x;cin>>i>>x;i--;
  		for(auto j:BE[i])sum[j]+=x-A[i];
  		A[i]=x;
  	}
  	else{
  		ll v;cin>>v;v--;
  		if(sz(E[v])>=B+10)cout<<sum[v]<<endl;
  		else{
  			ll ans=0;
  			for(auto u:E[v])ans+=A[u];
  			cout<<ans<<endl;
  		}
  	}
  }
  return 0;
}