using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        // Solve();
        Test();
    }
    static void Test()
    {
        var r = new Random();
        var n = 100000;
        var m = 100000;
        var q = 100000;
        var a = new int[n];
        for (var i = 0; i < n; ++i) a[i] = r.Next(1000) + 1;
        var map = new int[m][];
        var query = new int[q][];
        var set = new HashSet<long>();
        for (var i = 0; i < m; ++i)
        {
            while (true)
            {
                var u = r.Next(n) + 1;
                var v = r.Next(n) + 1;
                if (u > v) (u, v) = (v, u);
                if (u != v && set.Add(u * 200000L + v))
                {
                    map[i] = new int[] { u, v };
                    break;
                }
            }
        }
        for (var i = 0; i < q; ++i)
        {
            var id = r.Next(1, 4);
            if (id == 1)
            {
                query[i] = new int[] { id, r.Next(n) + 1, r.Next(n) + 1 };
                if (query[i][1] == query[i][2]) query[i][2] = query[i][2] % n + 1;
            }
            else if (id == 2)
            {
                query[i] = new int[] { id, r.Next(n) + 1, r.Next(1000) + 1 };
            }
            else
            {
                query[i] = new int[] { id, r.Next(n) + 1 };
            }
        }
        var start = DateTime.Now;
        var ans = Choco(n, m, map, a, q, query);
        WriteLine((DateTime.Now - start).TotalSeconds);
        WriteLine(string.Join(" ", ans.Take(5)));
    }
    static void Solve()
    {
        var c = NList;
        var (n, m) = (c[0], c[1]);
        var map = NArr(m);
        var a = NList;
        var q = NN;
        var query = NArr(q);
        WriteLine(string.Join("\n", Choco(n, m, map, a, q, query)));
    }
    static List<long> Choco(int n, int m, int[][] map, int[] a, int q, int[][] query)
    {
        var tree = new HashSet<int>[n];
        for (var i = 0; i < tree.Length; ++i) tree[i] = new HashSet<int>();
        var tmax = new int[n];
        foreach (var edge in map)
        {
            tree[edge[0] - 1].Add(edge[1] - 1);
            tree[edge[1] - 1].Add(edge[0] - 1);
            ++tmax[edge[0] - 1];
            ++tmax[edge[1] - 1];
        }
        var sq = (int)Math.Sqrt(q) * 20;
        var count = new long[n];
        var ans = new List<long>();
        for (var i = 0; i < q; i += sq)
        {
            for (var j = 0; j < n; ++j)
            {
                count[j] = 0;
                foreach (var next in tree[j]) count[j] += a[next];
            }
            var clist = new HashSet<int>();
            for (var j = i; j < q && j < i + sq; ++j) if (query[j][0] == 3) clist.Add(query[j][1] - 1);
            for (var j = i; j < q && j < i + sq; ++j)
            {
                if (query[j][0] == 1)
                {
                    var u = query[j][1] - 1;
                    var v = query[j][2] - 1;
                    if (tree[u].Contains(v))
                    {
                        tree[u].Remove(v);
                        if (tree[u].Count > 10 && tree[u].Count < tmax[u] / 2)
                        {
                            tree[u] = new HashSet<int>(tree[u]);
                            tmax[u] = tree[u].Count;
                        }
                        tree[v].Remove(u);
                        if (tree[v].Count > 10 && tree[v].Count < tmax[v] / 2)
                        {
                            tree[v] = new HashSet<int>(tree[v]);
                            tmax[v] = tree[v].Count;
                        }
                        count[u] -= a[v];
                        count[v] -= a[u];
                    }
                    else
                    {
                        tree[u].Add(v);
                        tmax[u] = Math.Max(tmax[u], tree[u].Count);
                        tree[v].Add(u);
                        tmax[v] = Math.Max(tmax[v], tree[v].Count);
                        count[u] += a[v];
                        count[v] += a[u];
                    }
                }
                else if (query[j][0] == 2)
                {
                    var p = query[j][1] - 1;
                    var na = query[j][2];
                    foreach (var ci in tree[p]) if (tree[ci].Contains(p))
                    {
                        count[ci] += na - a[p];
                    }
                    a[p] = na;
                }
                else
                {
                    ans.Add(count[query[j][1] - 1]);
                }
            }
        }
        return ans;
    }
}