#include <bits/stdc++.h>
namespace solution
{
    typedef long long i64;

    constexpr int MAXN = 1e5 + 5;

    int c, t;
    
    int n, m, q;

    int a[MAXN], b[MAXN];

    std::vector<int> e[MAXN];

    int vis[MAXN];
    int dfs(int u, int al, int ar)
    {
        int &ans = vis[u];
        if (ans != -1) return ans;
        ans = al <= a[u] && a[u] <= ar ? b[u] : 0;

        for (auto v : e[u])
        {
            ans = std::max(ans, dfs(v, al, ar));
        }

        return ans;
    }

    int mian()
    {
        std::ifstream fin("recall.in"); std::ofstream fout("recall.out");

        fin >> c >> t;
        while (t--)
        {
            fin >> n >> m >> q;
            for (int i = 1; i <= m; i++)
            {
                int u, v; fin >> u >> v;
                e[u].push_back(v);
            }
            for (int i = 1; i <= n; i++) fin >> a[i];
            for (int i = 1; i <= n; i++) fin >> b[i];

            for (int i = 1; i <= q; i++)
            {
                int op; fin >> op;
                if (op == 1)
                {
                    int x, y; fin >> x >> y;
                    std::swap(a[x], a[y]);
                }
                if (op == 2)
                {
                    int x, y; fin >> x >> y;
                    std::swap(b[x], b[y]);
                }
                if (op == 3)
                {
                    int x, l, r; fin >> x >> l >> r;
                    fout << (std::fill(vis + 1, vis + n + 1, -1), dfs(x, l, r)) << '\n';
                }
            }

            for (int i = 1; i <= n; i++) std::vector<int>().swap(e[i]);
        }

        return 0;
    }
}

int main()
{
    solution::mian();
    return 0;
}