#include #define fi first #define se second #define rep(i,s,n) for (int i = (s); i < (n); ++i) #define rrep(i,g,n) for (int i = (n)-1; i >= (g); --i) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define len(x) (int)(x).size() #define dup(x,y) (((x)+(y)-1)/(y)) #define pb push_back #define eb emplace_back #define Field(T) vector> using namespace std; using ll = long long; using ull = unsigned long long; template using pq = priority_queue,greater>; using P = pair; templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(b> n >> m >> q; vector> G(n); vector s(n); rep(i,0,n) cin >> s[i]; vector u(m), v(m); vector w(m); rep(i,0,m) { cin >> u[i] >> v[i] >> w[i]; --u[i], --v[i]; if (i < 70 && w[i] <= (2000000000000000100)>>(i+1)) { G[u[i]].eb(v[i], w[i]<<(i+1)); G[v[i]].eb(u[i], w[i]<<(i+1)); } } vector dist(n, 0); pq

que; rep(i,0,n) { dist[i] = s[i]; que.emplace(s[i], i); } while(!que.empty()) { auto [c, v] = que.top(); que.pop(); if (dist[v] < c) continue; for (auto [nv, cost] : G[v]) { if (dist[nv] > dist[v]+cost) { dist[nv] = dist[v]+cost; que.emplace(dist[nv], nv); } } } vector> mp(n); rep(s,0,n) { que.emplace(0, s); mp[s][s] = 0; while(!que.empty()) { auto [c, v] = que.top(); que.pop(); if (mp[s][v] < c) continue; for (auto [nv, cost] : G[v]) { if (!mp[s].contains(nv) || mp[s][nv] > c+cost) { mp[s][nv] = c+cost; que.emplace(c+cost, nv); } } } } while(q--) { int a, b; cin >> a >> b; --a, --b; ll ans = dist[a]+dist[b]; if (mp[a].contains(b)) { chmin(ans, mp[a][b]); } cout << ans << endl; } return 0; }