# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
template<class T>constexpr T inf() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T hinf() { return inf<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }
template<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; }
template<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; }
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); };
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; };
ll MOD(ll x, ll m){return (x%m+m)%m; }
ll FLOOR(ll x, ll m) {ll r = (x%m+m)%m; return (x-r)/m; }
template<class T> using dijk = priority_queue<T, vector<T>, greater<T>>;
# define all(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        (wpwpw).erase(unique(all((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(all((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(all((rprpr)),(rprpr).begin(),TU<char>)
# define rep(i,upupu)         for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)
# define reps(i,opopo)        for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++)
# define len(x)                ((ll)(x).size())
# define bit(n)               (1LL << (n))
# define pb push_back
# define eb emplace_back
# define exists(c, e)         ((c).find(e) != (c).end())

struct INIT{
	INIT(){
		std::ios::sync_with_stdio(false);
		std::cin.tie(0);
		cout << fixed << setprecision(20);
	}
}INIT;

namespace mmrz {
	void solve();
}

int main(){
	mmrz::solve();
}
#define debug(...) (static_cast<void>(0))

using namespace mmrz;

void SOLVE(){
	int n, m;
	cin >> n >> m;
	constexpr int B = 500;
	vector<set<int>> g(n);
	vector<ll> a(n);
	vector<ll> s(n);
	set<int> big;
	auto edge_set = [&](int from, int to) -> void {
		if(len(g[from]) < B-1){
			s[to] += a[from];
		}else if(len(g[from]) == B-1){
			for(auto nxt : g[from]){
				s[nxt] -= a[from];
			}
			big.insert(from);
		}
		g[from].insert(to);
	};
	auto edge_undo = [&](int from, int to) -> void {
		if(len(g[from]) == B){
			for(auto nxt : g[from]){
				if(nxt != to)s[nxt] += a[from];
			}
			big.erase(from);
		}else if(len(g[from]) < B){
			s[to] -= a[from];
		}
		g[from].erase(to);
	};
	auto node_add = [&](int p, ll x) -> void {
		if(len(g[p]) < B){
			for(auto to : g[p]){
				s[to] += x;
			}
		}
		a[p] = x;
	};
	{
		vector<int> x(m), y(m);
		rep(i, m)cin >> x[i] >> y[i], x[i]--, y[i]--;
		rep(i, n)cin >> a[i];
		rep(i, m){
			edge_set(x[i], y[i]);
			edge_set(y[i], x[i]);
		}
	}
	int q;
	cin >> q;
	while(q--){
		int op;
		cin >> op;
		if(op == 1){
			int x, y;
			cin >> x >> y;
			x--, y--;
			if(not g[x].contains(y)){
				edge_set(x, y);
				edge_set(y, x);
			}else{
				edge_undo(x, y);
				edge_undo(y, x);
			}
		}else if(op == 2){
			ll p, x;
			cin >> p >> x;
			p--;
			node_add(p, -a[p]);
			node_add(p, x);
		}else{
			int c;
			cin >> c;
			c--;
			ll ans = s[c];
			for(auto b : big){
				if(g[c].contains(b))ans += a[b];
			}
			cout << ans  << '\n';
		}
	}
}

void mmrz::solve(){
	int t = 1;
	//cin >> t;
	while(t--)SOLVE();
}