#line 2 "template.hpp"
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
using namespace std;
// https://xn--kst.jp/blog/2019/08/29/cpp-comp/
// debug methods
// usage: debug(x,y);
// vector 出力できるように修正
template <typename T>
ostream& debug_print(ostream& os, const vector<T>& v) {
    os << "[";
    for (size_t i = 0; i < v.size(); ++i) {
        os << v[i];
        if (i < v.size() - 1) os << ", ";
    }
    os << "]";
    return os;
}
template <typename T>
ostream& debug_print(ostream& os, const T& var) {
    os << var;
    return os;
}
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define debug_1(x1) { cout << #x1 << ": "; debug_print(cout, x1) << endl; }
#define debug_2(x1, x2) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << endl; }
#define debug_3(x1, x2, x3) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << endl; }
#define debug_4(x1, x2, x3, x4) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << ", " << #x4 << ": "; debug_print(cout, x4) << endl; }
#define debug_5(x1, x2, x3, x4, x5) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << ", " << #x4 << ": "; debug_print(cout, x4) << ", " << #x5 << ": "; debug_print(cout, x5) << endl; }

#ifdef LOCAL
#define debug(...) CHOOSE((__VA_ARGS__, debug_5, debug_4, debug_3, debug_2, debug_1, ~))(__VA_ARGS__)
#else
#define debug(...)
#endif

using ll = long long;
using vl = vector<ll>;
using Graph = vector<vector<ll>>;
using P = pair<ll, ll>;
#define all(v) v.begin(), v.end()
template <typename T> inline bool chmax(T &a, T b) {
    return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
    return ((a > b) ? (a = b, true) : (false));
}
#define rep1(i, n) for(ll i = 1; i <= ((ll)n); ++i)
// https://trap.jp/post/1224/
template <class... T> constexpr auto min(T... a) {
    return min(initializer_list<common_type_t<T...>>{a...});
}
template <class... T> constexpr auto max(T... a) {
    return max(initializer_list<common_type_t<T...>>{a...});
}
template <class... T> void input(T &...a) { (cin >> ... >> a); }
template <class T> void input(vector<T> &a) {
    for(T &x : a)
        cin >> x;
}
void print() { cout << '\n'; }
template <class T, class... Ts> void print(const T &a, const Ts &...b) {
    cout << a;
    (cout << ... << (cout << ' ', b));
    cout << '\n';
}
void print(const string &s) {
    cout << s << '\n';
}
template <class Container, typename = void>
struct is_container : std::false_type {};
template <class Container>
struct is_container<Container, std::void_t<decltype(std::declval<Container>().begin()), decltype(std::declval<Container>().end())>> : std::true_type {};
template <class Container>
typename enable_if<is_container<Container>::value>::type print(const Container& x) {
    if (!x.empty()) {
        auto it = x.begin();
        for (; it != prev(x.end()); ++it) {
            cout << *it << " ";
        }
        cout << *it << "\n";  // 最後の要素を出力して改行
    }
}
#define INT(...)                                                               \
    int __VA_ARGS__;                                                           \
    input(__VA_ARGS__)
#define LL(...)                                                                \
    long long __VA_ARGS__;                                                     \
    input(__VA_ARGS__)
#define STR(...)                                                               \
    string __VA_ARGS__;                                                        \
    input(__VA_ARGS__)
#define REP1(a) for(ll i = 0; i < a; i++)
#define REP2(i, a) for(ll i = 0; i < a; i++)
#define REP3(i, a, b) for(ll i = a; i < b; i++)
#define REP4(i, a, b, c) for(ll i = a; i < b; i += c)
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)

ll inf = 3e18;
vl dx = {1, -1, 0, 0};
vl dy = {0, 0, 1, -1};
#line 2 "/home/y_midori/cp/test/ng.test.cpp"
// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint998244353;
void solve() {
    INT(n, m);
    using uset = unordered_set<int>;
    vector<uset> g(n), t(n);
    rep(i, m) {
        INT(x, y);
        --x, --y;
        g[x].insert(y);
        g[y].insert(x);
    }
    const int b = 1000;
    // const int b = 2;
    vl a(n);
    input(a);
    vl sum(n, 0);
    rep(i, n) {
        if(g[i].size() >= b) {
            for(auto j : g[i]) {
                t[j].insert(i);
                sum[i] += a[j];
            }
        }
    }
    LL(q);
    auto t_in_out = [&](int x, int y, bool ins = true) {
        if(ins) {
            t[y].insert(x);
            sum[x] += a[y];
        } else {
            t[y].erase(x);
            sum[x] -= a[y];
        }
    };
    auto ins_t = [&](int x) {
        sum[x] = 0;
        for(auto i : g[x]) {
            t[i].insert(x);
            sum[x] += a[i];
        }
    };
    auto del_t = [&](int x) {
        for(auto i : g[x]) {
            t[i].erase(x);
        }
    };
    while(q--) {
        LL(flag);
        if(flag == 1) {
            INT(x, y);
            --x, --y;
            if(g[x].contains(y)) {
                if(g[x].size() >= b) {
                    t_in_out(x, y, false);
                }
                if(g[y].size() >= b) {
                    t_in_out(y, x, false);
                }
                g[x].erase(y);
                g[y].erase(x);
                if(g[x].size() + 1 == b)
                    del_t(x);
                if(g[y].size() + 1 == b)
                    del_t(y);
            } else {
                if(g[x].size() >= b) {
                    t_in_out(x, y);
                }
                if(g[y].size() >= b) {
                    t_in_out(y, x);
                }
                g[x].insert(y);
                g[y].insert(x);
                if(g[x].size() == b)
                    ins_t(x);
                if(g[y].size() == b)
                    ins_t(y);
            }
        } else if(flag == 2) {
            LL(p, ai);
            --p;
            ll dif = ai - a[p];
            a[p] = ai;
            for(auto i : t[p])
                sum[i] += dif;
        } else {
            LL(c);
            --c;
            if(g[c].size() >= b) {
                print(sum[c]);
            } else {
                ll ans = 0;
                for(auto i : g[c])
                    ans += a[i];
                print(ans);
            }
        }
        // debug(q);
        // rep(i,n){
        //     // cout << i << " : "<<sum[i]<<" : ";for(auto j:g[i])cout << j << " ";cout<<endl;
        //     debug(i,sum[i]);
        //     for(auto j:g[i])cout<<j<<" ";cout<<endl;
        //     if(t[i].size()){for(auto j:t[i])cout<<j<<" ";cout<<endl;}
        // }
    }
}
int main() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    cout << std::setprecision(16);
    int t = 1;
    rep(_, t) {
        solve();
    }
}