Post disaster reconstruction -- Floyd thought

In the future, you must see the conditions clearly
The time array of this question is not reduced , The query is not reduced , I can't see , Mapping half a day ...

Topic link

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
typedef pair<int, int> PII;
const int N = 210,INF=0x3f3f3f3f;
int w[N];
int d[N][N];
int n,m;
signed main()
{
    
   cin>>n>>m;
   memset(d,0x3f,sizeof d);
   for(int i=0;i<n;i++)cin>>w[i],d[i][i]=0;
   for(int i=0;i<m;i++)
   {
    
   		int a,b,c;
   		cin>>a>>b>>c;
   		d[a][b]=d[b][a]=c;
   }
   int q;
   cin>>q;
   int pos=0;
   while(q--)
   {
    
   		int x,y,t;
   		cin>>x>>y>>t;
   		for(;w[pos]<=t&&pos<n;pos++)
   			for(int i=0;i<n;i++)
   				for(int j=0;j<n;j++)
   					d[i][j]=d[j][i]=min(d[i][j],d[i][pos]+d[pos][j]);

		if(w[x]>t||w[y]>t)cout<<-1<<'\n';
		else
		{
    
			if(d[x][y]>INF/2)cout<<-1<<'\n';
			else cout<<d[x][y]<<'\n';
		}
   }
}