https://www.luogu.org/problemnew/show/P1119

题解：Floyd

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=1000+10;
const int M=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q,u,v,w;
int ans,cnt,flag,temp,sum;
int a[N];
bool vis[N];
char str;
int mp[210][210];
int dist[210][210];
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    //ios::sync_with_stdio(false);
    //cin.tie(0);
    //cout.tie(0);
    //scanf("%d",&t);
    //while(t--){
    scanf("%d%d",&n,&m);
    for(int i=0;i<n;i++){
        scanf("%d",&a[i]);
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(i!=j)dist[i][j]=INF;
        }
    }
    for(int i=1;i<=m;i++){
        scanf("%d%d%d",&u,&v,&w);
        dist[u][v]=dist[v][u]=w;
    }
    scanf("%d",&q);
    int now=0;
    while(q--){
        scanf("%d%d%d",&u,&v,&w);
        if(a[u]>w||a[v]>w){
            cout<<-1<<endl;
            continue;
        }
        for(;a[now]<=w&&now<n;now++){
            for(int i=0;i<n;i++){
                for(int j=0;j<n;j++){
                   dist[j][i]=dist[i][j]=min(min(dist[i][j],dist[j][i]),dist[i][now]+dist[now][j]);
                }
            }
        }
        if(dist[u][v]!=INF){
            cout<<dist[u][v]<<endl;
        }else{
            cout<<-1<<endl;
        }
    }

    //}

#ifdef DEBUG
	printf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif
    //cout << "Hello world!" << endl;
    return 0;
}