// https://github.com/potato167/po167_library #include #include using namespace std; using ll=long long; const ll ILL=2167167167167167167; const int INF=2100000000; #define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++) #define all(p) p.begin(),p.end() template using pq_ = priority_queue, greater>; template int LB(vector &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();} template int UB(vector &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();} template bool chmin(T &a,T b){if(b bool chmax(T &a,T b){if(a void So(vector &v) {sort(v.begin(),v.end());} template void Sore(vector &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});} bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;} template void vec_out(vector &p,int ty=0){ if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'< T vec_min(vector &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;} template T vec_max(vector &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;} template T vec_sum(vector &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;} int pop_count(long long a){int res=0;while(a){res+=(int)(a&1),a>>=1;}return res;} template T square(T a){return a * a;} namespace po167{ struct UF { using _F = int; int _n; std::vector<_F> wei; std::vector q; int component; UF(int n):_n(n), wei(n), component(n), par(n){ for (int i = 0; i < n; i++){ wei[i] =1, par[i] = i; } } void intialize(){ for (auto x : q){ wei[root(x)] = 1; par[x] = x; wei[x] = 1; } component = (int)par.size(); q = {}; } //根っこを返す int root(int a){ assert(0 <= a && a < _n); if (a == par[a]) return a; return par[a] = root(par[a]); } //trueなら1,falseなら0 int same(int a, int b){ assert(0 <= a && a < _n); assert(0 <= b && b < _n); if(root(a) == root(b)) return 1; else return 0; } _F size(int a){ return wei[root(a)]; } //a,bが違う根っこの元なら結合する,結合したらtrueを返す bool unite(int a,int b){ a = root(a), b = root(b); if (a == b) return false; if (wei[a] < wei[b]) std::swap(a, b); par[b] = a; q.push_back(b); wei[a] += wei[b]; component--; return true; } private: std::vector par; }; } using po167::UF; void solve(); // DEAR MYSTERIES / TOMOO int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t = 1; // cin >> t; rep(i, 0, t) solve(); } void solve(){ int N, M, Q; cin >> N >> M >> Q; vector S(N); rep(i, 0, N) cin >> S[i]; UF T(N); vector U, V; vector W; rep(i, 0, M) { int u, v; ll w; cin >> u >> v >> w; u--, v--; if (w == 0) { T.unite(u, v); } else { rep(j, 0, i + 1) if (w < ILL) w *= 2; if (w < ILL) { U.push_back(u); V.push_back(v); W.push_back(w); } } } rep(i, 0, N) { chmin(S[T.root(i)], S[i]); } rep(i, 0, U.size()) { U[i] = T.root(U[i]); V[i] = T.root(V[i]); } vector>> G(N); rep(i, 0, U.size()) { G[U[i]].push_back({V[i], W[i]}); G[V[i]].push_back({U[i], W[i]}); } vector seen(N, ILL); auto f = [&](int var) -> vector> { var = T.root(var); vector> res; pq_> pq; pq.push({0, var}); seen[var] = 0; while (!pq.empty()) { auto tmp = pq.top(); pq.pop(); if (seen[tmp.second] != tmp.first) continue; res.push_back({tmp.second, tmp.first}); for (auto x : G[tmp.second]) { if (chmin(seen[x.first], x.second + tmp.first)) { pq.push({seen[x.first], x.first}); } } } for (auto tmp : res) seen[tmp.first] = ILL; return res; }; while (Q--) { int a, b; cin >> a >> b; a--, b--; auto A = f(a), B = f(b); ll ans = ILL; for (auto x : A) for (auto y : B) { if (x.first == y.first) chmin(ans, x.second + y.second); else chmin(ans, x.second + y.second + S[x.first] + S[y.first]); } cout << ans << "\n"; } } /* * S[i] + S[j] が基本 * それ以外は、高々60本のものを */