第七个点WA了

#include<bits/stdc++.h>
#define ll long long
#define inf 1e9
using namespace std;
const int MAXN=205;
ll a[MAXN][MAXN];
int main(){
	int n,m;cin >> n >> m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(i==j) a[i][j]=0;
			else a[i][j]=INT_MAX;
		}
	}
	while(m--){
		ll u,v,w;cin >> u >> v >> w;
		a[u][v]=a[v][u]=min(a[u][v],w);
	}
	for(int k=1;k<=n;k++){
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n;j++){
				a[i][j]=a[j][i]=min(a[i][k]+a[k][j],a[i][j]);
			}
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			cout << a[i][j] << " ";
		}
		cout << "\n"; 
	}
	return 0;
}