求助，SPFA不知道哪儿错，样例输出76,0pts

#include <stdio.h>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
const int maxn=105;
vector <int> e[maxn];
int w[maxn],dis[maxn];
long long minn,ans=0x7fffffff;
void SPFA(int a)
{
	for(int i=1;i<=maxn;i++) dis[i]=0x7fffffff;
	dis[a]=0;
	queue <int> q;
	q.push(a);
	while(!q.empty())
	{
		int u=q.front();
		q.pop();
		for(int i=0;i<e[u].size();i++)
		{
			int v=e[u][i];
			if(dis[v]>dis[u]+w[u])
			{
				dis[v]=dis[u]+w[u];
				q.push(v);
			}
		}
	}
	return ;
}
int main()
{
	int n;
	scanf("%d",&n);
	int u,v;
	for(int i=1;i<=n;i++)
	{
		scanf("%d%d%d",&w[i],&u,&v);
		if(u) e[i].push_back(u);
		if(v) e[i].push_back(v);
	}
	for(int i=1;i<=n;i++)
	{
		SPFA(i);
		minn=0;
		for(int i=1;i<=n;i++) minn+=dis[i];
		ans=min(minn,ans);
	}
	printf("%lld\n",ans);
}