#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define all(p) (p).begin(),(p).end()

int main(){
	ios::sync_with_stdio(false);
    cin.tie(nullptr);

	int N, M;
	cin >> N >> M;
	vector<unordered_set<int>> G(N);
	vector<ll> A(N);
	vector<ll> sum(N);
	vector<int> big(N);
	vector<int> big_deg;
	vector<vector<int>> H(N);
	const int B = 500;
	auto add_edge = [&](int from, int to) -> void {
		if (G[from].count(to)){
			G[from].erase(to);
			if (big[from] == 0){
				sum[to] -= A[from];
			}
			else{
				H[from][to] = 0;
			}
		}
		else{
			G[from].insert(to);
			if (big[from] == 0){
				sum[to] += A[from];
				if (B == (int)G[from].size()){
					big_deg.push_back(from);
					big[from] = 1;
					H[from].resize(N, 0);
					for (auto x : G[from]) H[from][x] = 1, sum[x] -= A[from];
				}
			}
			else{
				H[from][to] = 1;
			}
		}
	};
	auto upd_A = [&](int ind, ll a) -> void {
		ll diff = a - A[ind];
		A[ind] = a;
		if (big[ind] == 0){
			for (auto x : G[ind]) sum[x] += diff;
		}	
	};
	for (int i = 0; i < M; i++){
		int a, b;
		cin >> a >> b;
		a--, b--;
		add_edge(a, b);
		add_edge(b, a);
	}
	for (int i = 0; i < N; i++){
		int a;
		cin >> a;
		upd_A(i, a);
	}
	ll ans = 0;
	int Q;
	cin >> Q;
	while (Q--){
		int t;
		cin >> t;
		if (t == 1){
			int a, b;
			cin >> a >> b;
			a--, b--;
			add_edge(a, b);
			add_edge(b, a);
		}
		if (t == 2){
			int i, a;
			cin >> i >> a;
			i--;
			upd_A(i, a);
		}
		if (t == 3){
			int c;
			cin >> c;
			c--;
			ans = sum[c];
			for (auto x : big_deg) if (H[x][c]) ans += A[x];
			cout << ans << "\n";
		}
	}
}