#include <bits/stdc++.h>
using namespace std;
using ll = long long;

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

    int N, M;
    cin >> N >> M;
    vector<unordered_set<int>> G(N);
    for (int i = 0; i < M; i++){
        int a, b;
        cin >> a >> b;
        a--, b--;
        G[a].insert(b);
        G[b].insert(a);
    }
    vector<ll> A(N);
    vector<ll> ans(N);
    for (int i = 0; i < N; i++){
        cin >> A[i];
    }
    for (int i = 0; i < N; i++) for (auto x : G[i]) ans[x] += A[i];
    int Q;
    cin >> Q;
    while (Q--){
        int t;
        cin >> t;
        if (t == 1){
            int a, b;
            cin >> a >> b;
            a--, b--;
            if (G[a].count(b)){
                G[a].erase(b);
                G[b].erase(a);
                ans[a] -= A[b];
                ans[b] -= A[a];
            } else {
                G[a].insert(b);
                G[b].insert(a);
                ans[a] += A[b];
                ans[b] += A[a];
            }
        }
        if (t == 2){
            int i, a;
            cin >> i >> a;
            i--;
            for (auto x : G[i]) ans[x] += a - A[i];
            A[i] = a;
        }
        if (t == 3){
            int c;
            cin >> c;
            c--;
            cout << ans[c] << "\n";
        }
    }
}