#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint;

/*
更新時→そのまま変更するとともに、
大きい頂点に対する変更の履歴を持っておく
（直接辺で結ばれているかどうかで更新するかどうか判断する）

次数が小さい頂点
和の取得時→そのまま足し合わせる

次数が大きくなることがある頂点（オフライン可能なので決め打ち）
和の取得時→変更の履歴を出力する
*/

int main() {
    ll N, M;
    cin >> N >> M;
    vector<ll> x(M);
    vector<ll> y(M);
    for (ll i = 0; i < M; i++) {
        cin >> x[i] >> y[i];
        x[i]--;
        y[i]--;
    }
    vector<ll> A(N);
    for (ll i = 0; i < N; i++) {
        cin >> A[i];
    }
    ll Q;
    cin >> Q;
    vector<ll> t(Q, -1);
    vector<ll> u(Q, -1);
    vector<ll> v(Q, -1);
    vector<ll> p(Q, -1);
    vector<ll> a(Q, -1);
    vector<ll> c(Q, -1);
    vector<ll> ans(Q, -1);
    for (ll i = 0; i < Q; i++) {
        cin >> t[i];
        if (t[i] == 1) {
            cin >> u[i] >> v[i];
            u[i]--;
            v[i]--;
        } else if (t[i] == 2) {
            cin >> p[i] >> a[i];
            p[i]--;
        } else {
            cin >> c[i];
            c[i]--;
        }
    }
    ll bsize = 300;
    vector<bool> islarge(N, false);
    vector<ll> larges(0);
    vector<set<ll>> graph(N);
    for (ll i = 0; i < M; i++) {
        graph[x[i]].insert(y[i]);
        graph[y[i]].insert(x[i]);
    }
    for (ll i = 0; i < N; i++) {
        if (graph[i].size() >= bsize) {
            islarge[i] = true;
            larges.push_back(i);
        }
    }
    for (ll i = 0; i < Q; i++) {
        if (t[i] == 1) {
            if (graph[u[i]].find(v[i]) == graph[u[i]].end()) {
                graph[u[i]].insert(v[i]);
                graph[v[i]].insert(u[i]);
                if (graph[u[i]].size() >= bsize) {
                    islarge[u[i]] = true;
                }
                if (graph[v[i]].size() >= bsize) {
                    islarge[v[i]] = true;
                }
            } else {
                graph[u[i]].erase(v[i]);
                graph[v[i]].erase(u[i]);
            }
        }
    }
    for (ll i = 0; i < N; i++) {
        graph[i].clear();
    }
    vector<ll> now_sum(N, 0);
    for (ll i = 0; i < M; i++) {
        graph[x[i]].insert(y[i]);
        graph[y[i]].insert(x[i]);
    }
    for (ll i = 0; i < N; i++) {
        if (islarge[i]) {
            for (auto itr = graph[i].begin(); itr != graph[i].end(); itr++) {
                now_sum[i] += A[(*itr)];
            }
        }
    }
    for (ll i = 0; i < Q; i++) {
        if (t[i] == 1) {
            if (graph[u[i]].find(v[i]) == graph[u[i]].end()) {
                graph[u[i]].insert(v[i]);
                graph[v[i]].insert(u[i]);
                if (islarge[u[i]]) {
                    now_sum[u[i]] += A[v[i]];
                }
                if (islarge[v[i]]) {
                    now_sum[v[i]] += A[u[i]];
                }
            } else {
                graph[u[i]].erase(v[i]);
                graph[v[i]].erase(u[i]);
                if (islarge[u[i]]) {
                    now_sum[u[i]] -= A[v[i]];
                }
                if (islarge[v[i]]) {
                    now_sum[v[i]] -= A[u[i]];
                }
            }
        } else if (t[i] == 2) {
            for (ll x : larges) {
                if (graph[p[i]].find(x) != graph[p[i]].end()) {
                    now_sum[x] += (a[i] - A[p[i]]);
                }
            }
            A[p[i]] = a[i];
        } else {
            if (islarge[c[i]]) {
                cout << now_sum[c[i]] << endl;
            } else {
                ll ans = 0;
                for (auto itr = graph[c[i]].begin(); itr != graph[c[i]].end();
                     itr++) {
                    ans += A[(*itr)];
                }
                cout << ans << endl;
            }
        }
    }
}