#include namespace { #pragma GCC diagnostic ignored "-Wunused-function" #include #pragma GCC diagnostic warning "-Wunused-function" using namespace std; using namespace atcoder; #define rep(i,n) for(int i = 0; i < (int)(n); i++) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--) #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) template bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; } template bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; } using ll = long long; using P = pair; using VI = vector; using VVI = vector; using VL = vector; using VVL = vector; } int main() { ios::sync_with_stdio(false); cin.tie(0); int n, m, q; cin >> n >> m >> q; dsu uf(n); VL s(n); rep(i, n) cin >> s[i]; vector> es; for (int i = 1; i <= m; i++) { int u, v; ll w; cin >> u >> v >> w; u--, v--; if (w == 0) { u = uf.leader(u), v = uf.leader(v); s[uf.merge(u, v)] = min(s[u], s[v]); } else if (i <= 61 && __int128(w) << i < (ll)2e18) { es.emplace_back(u, v, w << i); } } vector>> to(n + 1); for (auto [u, v, w] : es) { u = uf.leader(u); v = uf.leader(v); to[u].emplace_back(v, w); to[v].emplace_back(u, w); } rep(i, n) if (uf.leader(i) == i) to[i].emplace_back(n, s[i]); vector>> dist(n); struct E { int v; ll d; bool operator<(const E& rhs) const { return d > rhs.d; } }; constexpr long long INF = 2002003004005006007; priority_queue pq; VL t(n + 1, INF); VI visited; rep(u, n) if (uf.leader(u) == u) { pq.emplace(u, 0); t[u] = 0; while (pq.size()) { auto [u, d] = pq.top(); pq.pop(); if (t[u] != d) continue; visited.emplace_back(u); for (auto [v, w] : to[u]) if (chmin(t[v], d + w)) pq.emplace(v, d + w); } sort(all(visited)); for (int v : visited) dist[u].emplace_back(v, t[v]), t[v] = INF; visited.clear(); } rep(_, q) { int a, b; cin >> a >> b; a = uf.leader(a - 1), b = uf.leader(b - 1); ll ans = dist[a].back().second + dist[b].back().second; if (auto it = ranges::lower_bound(dist[a], b, {}, &pair::first); it->first == b) chmin(ans, it->second); cout << ans << '\n'; } }