为什么不能在floyd的同时记录沿途点权最大值

#include<cstdio>
#include<cstring>
const int maxn=255;
const int inf=2139062143;
inline int max_(int x,int y){return x>y?x:y;}
inline int min_(int x,int y){return x<y?x:y;}
int n,m,test;
int map[maxn][maxn],big[maxn][maxn];
int main()
{
    memset(big,0x7f,sizeof(big));
    memset(map,0x7f,sizeof(map));
    scanf("%d%d%d",&n,&m,&test);
    for(int i=1;i<=n;i++) scanf("%d",&big[i][i]),map[i][i]=0;
    int a,b,c;
    for(int i=1;i<=m;i++){
        scanf("%d%d%d",&a,&b,&c);
        map[a][b]=map[b][a]=min_(map[a][b],c);
        big[a][b]=big[b][a]=max_(big[a][a],big[b][b]);
    }
    for(int k=1;k<=n;k++)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                if(0ll+map[i][k]+map[k][j]+max_(big[i][k],big[k][j])<0ll+map[i][j]+big[i][j]) 
                    map[i][j]=map[i][k]+map[k][j],big[i][j]=max_(big[i][k],big[k][j]);
    int s,t;
    for(int i=1;i<=test;i++)
    {
        scanf("%d%d",&s,&t);
        printf("%d\n",map[s][t]+big[s][t]);
    }
    return 0;
}