1
#include <bits/stdc++.h>
2
#define int long long
3
using namespace std;
4
typedef pair<int, int> pii;
5
const int N = 4e5 + 100;
6
int n, m, q;
7
int ans[N], cnt;
8
int qs[N];
9
int c[N], d[N];
10

11
struct Hash {
12
    size_t operator()(const pii &p) const {
13
        return p.first * (n + 1) + p.second;
14
    }
15
};
16

17
unordered_set<pii, Hash> vis, err;
18

19
struct Node {
20
    int v, id;
21
    friend bool operator<(const Node a, const Node b) {
22
        if (a.v == b.v)
23
            return a.id > b.id;
24
        return a.v > b.v;
25
    }
26
} a[N], b[N];
27

28
struct Chefs : public pii {
29
    Chefs(int x, int y) : pii(x, y) {}
30

31
    int value() const {
32
        int ida = a[first].id;
33
        int idb = b[second].id;
34
        return max(c[ida], c[idb]) + max(d[ida], d[idb]);
35
    }
36
    friend bool operator<(const Chefs &x, const Chefs &y) {
37
        auto sx = x.value();
38
        auto sy = y.value();
39
        if (sx != sy)
40
            return sx < sy;
41
        if (a[x.first].id != a[y.first].id)
42
            return a[x.first].id < a[y.first].id;
43
        return b[x.second].id < b[y.second].id;
44
    }
45
};
46

47
priority_queue<Chefs> pq;
48

49
void solve(int need) {
50
    pq.push({1, 1});
51
    while (!pq.empty()) {
52
        auto top = pq.top();
53
        pq.pop();
54
        int chefa = a[top.first].id, chefb = b[top.second].id;
55
        if (vis.find(top) != vis.end()) {
56
            continue;
57
        }
58
        vis.insert(top);
59
        if (err.find({chefa, chefb}) == err.end() && chefa != chefb) {
60
            ans[++cnt] = top.value();
61
            if (cnt >= need)
62
                return;
63
        }
64
        err.insert({chefb, chefa});
65
        Chefs nxt = {top.first + 1, top.second};
66
        if (top.first + 1 <= n && vis.find(nxt) == vis.end()) {
67
            pq.push(nxt);
68
        }
69
        nxt = {top.first, top.second + 1};
70
        if (top.second + 1 <= n && vis.find(nxt) == vis.end()) {
71
            pq.push(nxt);
72
        }
73
    }
74
    return;
75
}
76

77
signed main() {
78
    ios::sync_with_stdio(false);
79
    cin.tie(0);
80
    cout.tie(0);
81
    cin >> n >> m >> q;
82
    for (int i = 1; i <= n; i++) {
83
        cin >> a[i].v;
84
        a[i].id = i;
85
        c[i] = a[i].v;
86
    }
87
    for (int i = 1; i <= n; i++) {
88
        cin >> b[i].v;
89
        b[i].id = i;
90
        d[i] = b[i].v;
91
    }
92
    sort(a + 1, a + n + 1);
93
    sort(b + 1, b + n + 1);
94
    for (int i = 1; i <= m; i++) {
95
        int u, v;
96
        cin >> u >> v;
97
        if (u > v)
98
            swap(u, v);
99
        err.insert({u, v});
100
        err.insert({v, u});
101
    }
102
    int need = 0;
103
    for (int i = 1; i <= q; i++) {
104
        cin >> qs[i];
105
        need = max(need, qs[i]);
106
    }
107
    solve(min(need, N - 1));
108
    for (int i = 1; i <= q; i++) {
109
        cout << ans[qs[i]] << endl;
110
    }
111
    return 0;
112
}