// Templates and Snippets -> https://github.com/igeeeeee/template #ifdef ONLINE_JUDGE #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #endif #include #include using namespace std; using namespace atcoder; typedef long long ll; typedef unsigned long long ull; typedef long double ld; using i128 = __int128_t; using u128 = __uint128_t; ostream& operator<<(ostream& os, u128 x) {if (x >= 10) os << x / 10;return os << char('0' + x % 10);} ostream& operator<<(ostream& os, i128 x){if (x < 0){os << '-';return os << (-(u128)x);}return os << (u128)x;} #define rep(i, n) for (ll i = 0; i < (ll)(n); i++) #define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--) #define repn(i,end) for(ll i = 0; i <= (ll)(end); i++) #define reps(i,start,end) for(ll i = start; i < (ll)(end); i++) #define repsn(i,start,end) for(ll i = start; i <= (ll)(end); i++) #define each(p,a) for(auto &p:a) typedef vector vll; typedef vector> vpll; typedef vector>> vvpll; typedef vector> vvll; typedef vector>> vvvll; typedef pair pll; typedef pair pull; typedef tuple tpl3; typedef tuple tpl4; typedef tuple tpl5; typedef tuple tpl6; #define FI first #define SE second #define LL(...) ll __VA_ARGS__; input(__VA_ARGS__) #define LD(...) ld __VA_ARGS__; input(__VA_ARGS__) #define Str(...) string __VA_ARGS__; input(__VA_ARGS__) #define Ch(...) char __VA_ARGS__; input(__VA_ARGS__) #define all(a) (a).begin(),(a).end() #define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() ); #define sz(x) (ll)x.size() // << std::fixed << std::setprecision(10) const ll INF = 1LL << 61; const ld EPS = 1e-9; ll lceil(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b)+1;}else{return -((-a)/b);}} ll lfloor(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b);}else{return -((-a)/b)-1;}} inline ll positive_mod(ll a,ll m){return (a % m + m)%m;} inline ll popcnt(ull a){ return __builtin_popcountll(a);} //0indexed inline ll topbit(ll a){assert(a != 0);return 63 - __builtin_clzll(a);} inline ll smlbit(ll a){assert(a != 0);return __builtin_ctzll(a);} template bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;} template bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;} template std::istream &operator>>(std::istream&is,std::vector&v){for(T &in:v){is>>in;}return is;} template std::ostream &operator<<(std::ostream&os,const std::vector&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?" ":"");}return os;} templatestd::ostream &operator<< (std::ostream &os, std::pair p){os << "{" << p.first << "," << p.second << "}";return os;} templatevoid input(T&... a){(cin >> ... >> a);} void print(){cout << endl;} templatevoid print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;} template void pspace(const T& a){ cout << a << ' ';} void perr(){cerr << endl;} templatevoid perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;} void yes(bool i = true){ return print(i?"yes":"no"); } void Yes(bool i = true){ return print(i?"Yes":"No"); } void YES(bool i = true){ return print(i?"YES":"NO"); } template vector &operator++(vector &v) {for(auto &e : v) e++;return v;} template vector operator++(vector &v, signed) {auto res = v;for(auto &e : v) e++;return res;} template vector &operator--(vector &v) {for(auto &e : v) e--;return v;} template vector operator--(vector &v, signed) {auto res = v;for(auto &e : v) e--;return res;} //grid探索用 vector _ta = {0,0,1,-1,1,1,-1,-1}; vector _yo = {1,-1,0,0,1,-1,1,-1}; bool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);} ll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;} ll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} const ll MOD9 = 998244353LL; const ll MOD10 = 1000000007LL; using mint = modint998244353; // using mint = modint1000000007; // using mint = modint;// mint::set_mod(m); void solve(); #ifdef DEBUG void naive(); string run(void (*f)(), const string& input) {istringstream iss(input);ostringstream oss;auto* cinbuf = cin.rdbuf(iss.rdbuf());auto* coutbuf = cout.rdbuf(oss.rdbuf());cin.clear();f();cout.flush();cin.rdbuf(cinbuf);cout.rdbuf(coutbuf);cin.clear();return oss.str();} bool check(const string& input) { string ans = run(solve, input);istringstream acin(ans); string correct = run(naive, input);istringstream ccin(correct); // ll x;acin >> x;とかで使える(構築とかの確認用) if (ans == correct) return true;//末尾の空白まで完全一致 cerr << "========== INPUT ==========\n"; cerr << input; cerr << "========== EXPECTED =======\n"; cerr << correct; cerr << "========== ACTUAL =========\n"; cerr << ans; cerr << "===========================\n"; return false; } uint64_t seed = chrono::steady_clock::now().time_since_epoch().count(); mt19937_64 rng(seed); ll rnd(ll l, ll r){// l 以上 r 以下 return uniform_int_distribution(l, r)(rng); } void test(){ rep(tc,100000){ // ----- テストケース生成(文字列で!!) ----- string input; ll n = rnd(1,10); input += to_string(n); input += '\n'; // ----- 比較 ----- check(input); if ((tc+1) % 1000 == 0) { cerr << tc+1 << " cases passed\n"; } } } void naive(){//cinで受け取りcoutで出力でよい } #endif inline bool is_mul_overflow(long long a, long long b) { #ifdef _MSC_VER long long high, low = _mul128(a, b, &high); return !((high == 0 && low >= 0) || (high == -1 && low < 0)); #else long long low; return __builtin_smulll_overflow(a, b, &low); #endif } void solve(){ LL(n,m,q); vll s(n);cin >> s; dsu uf(n); vector uvw; rep(i,m){ LL(u,v,w); u--;v--; if(w == 0){ //縮約 uf.merge(u,v); }else{ if((i+1)>=62)continue; assert((1LL<<(i+1))>= 0); if(!is_mul_overflow(w,1LL<<(i+1)) && w*(1LL<<(i+1))> gru = uf.groups(); vll gruid(n); ll siz = sz(gru); vll mins(siz,INF); rep(i,siz){ each(p,gru[i]){ gruid[p] = i; chmin(mins[i],s[p]); } } vvpll g(siz); for(auto[u,v,w] : uvw){ if(uf.same(u,v))continue; ll ui = gruid[u]; ll vi = gruid[v]; g[ui].emplace_back(vi,w); g[vi].emplace_back(ui,w); } vector> dist(siz); rep(i,siz){ dist[i][i] = 0 ; priority_queue> pq; pq.push({0,i}); while(!pq.empty()){ auto [val,id] = pq.top(); pq.pop(); if(val > dist[i][id])continue; for(auto [to,w]:g[id]){ if(val+w >= INF)continue; if(!dist[i].contains(to)){ dist[i][to] = val+w; pq.emplace(dist[i][to],to); }else if (chmin(dist[i][to],val+w)){ dist[i][to] = val+w; pq.emplace(dist[i][to],to); } } } } while(q--){ LL(a,b); a--;b--; if(uf.same(a,b)){ cout << 0 << endl; continue; } ll ai = gruid[a]; ll bi = gruid[b]; ll ans = mins[ai]+mins[bi]; each(p,dist[ai])each(q,dist[bi]){ chmin(ans,p.SE+mins[p.FI]+mins[bi]); chmin(ans,q.SE+mins[q.FI]+mins[ai]); if(p.FI == q.FI){ chmin(ans,p.SE+q.SE); } if(p.FI == bi)chmin(ans,p.SE); if(p.SE+q.SE >= INF)continue; if(p.SE+q.SE+mins[p.FI]>=INF)continue; chmin(ans,p.SE+q.SE+mins[p.FI]+mins[q.FI]); } assert(ans >= 0); cout << ans << endl; } } int main(){ ios::sync_with_stdio(false);cin.tie(nullptr); #ifdef DEBUG test(); #else solve(); #endif }