#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int maxn = 1000005;
int d[1005][1005],n,m,t[maxn];
int main(){
    //freopen("a.in","r",stdin);
    memset(d,0x3f,sizeof(d));
    scanf("%d%d",&n,&m);
    for (int i=0;i<n;i++) scanf("%d",&t[i]);
    int x,y,z;
    for (int i=1;i<=m;i++){
        scanf("%d%d%d",&x,&y,&z);
        d[x][y] = z;
        d[y][x] = z;
    }
    int nq,tag;
    scanf("%d",&nq);
    for (int i=0;i<n;i++) d[i][i] = 0;
    for (int i=1;i<=nq;i++){
        scanf("%d%d%d",&x,&y,&z);
        while(t[tag]<=z && tag < n){
            for (int i=0;i<n;i++){
                for (int j=0;j<n;j++){
                    d[i][j] = min(d[i][j],d[i][tag]+d[tag][j]);
                }
            }
            tag++;
        }
        if (d[x][y] >= maxn || t[x] > z || t[y] > z) printf("-1\n");
        else printf("%d\n",d[x][y]);
    }
}

如题