#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; typedef vector vi; typedef vector vl; typedef vector vvl; typedef vector vvvl; typedef vector vvvvl; typedef vector vb; typedef vector vvb; typedef vector vvvb; typedef vector vvvvb; typedef pair pl; typedef pair ppl; typedef pair pppl; typedef pair pppppl; #define rep(i,a,b) for(int i=(a);i<(b);i++) #define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--) #define all(a) begin(a),end(a) #define sz(a) (int)(a).size() #define F first #define S second #define bs(A,x) binary_search(all(A),x) #define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin()) #define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin()) #define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x)) templateusing min_priority_queue=priority_queue,greater>; templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(b vm; typedef vector vvm; typedef vector vvvm; typedef vector vvvvm; ostream&operator<<(ostream&os,mint a){os<>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;} //*/ templateostream&operator<<(ostream&os,pairp){os<istream&operator>>(istream&is,pair&p){is>>p.F>>p.S;return is;} templateostream&operator<<(ostream&os,vectorv){rep(i,0,sz(v))os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} int main(){ cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit); ll N,M,_;cin>>N>>M>>_; vl S(N);cin>>S; dsu D(N); vectores; rep(i,0,M){ ll u,v,w;cin>>u>>v>>w;u--;v--; if(!w)D.merge(u,v); if(i>=60)continue; __int128 W=w; W<<=i+1; if(W>3e18)continue; es.emplace_back(W,pl(u,v)); } vl I(N); auto gr=D.groups(); vl SS(N,3e18); rep(i,0,sz(gr))for(auto v:gr[i])I[v]=i,chmin(SS[i],S[v]); N=sz(gr); S=SS; vector>E(N); for(auto[w,p]:es){ auto[u,v]=p; E[I[u]].emplace_back(I[v],w); E[I[v]].emplace_back(I[u],w); } min_priority_queueQ; rep(i,0,N)Q.emplace(S[i],i); while(sz(Q)){ auto[d,v]=Q.top();Q.pop(); if(d!=S[v])continue; for(auto[u,w]:E[v])if(chmin(S[u],S[v]+w))Q.emplace(S[u],u); } vl DD(N,3e18); while(_--){ ll a,b;cin>>a>>b;a--;b--; a=I[a];b=I[b]; ll ans=S[a]+S[b]; vl EE; DD[a]=0; Q.emplace(0,a); while(sz(Q)){ auto[d,v]=Q.top();Q.pop(); if(d!=DD[v])continue; EE.emplace_back(v); for(auto[u,w]:E[v])if(chmin(DD[u],DD[v]+w))Q.emplace(DD[u],u); } chmin(ans,DD[b]); for(auto v:EE)DD[v]=3e18; cout<