60分求助

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#define MAXN 10000+10
#define ll long long
using namespace std;
inline ll read(){
	ll out=0;
	char c=getchar();
	while(c<48||c>57) c=getchar();
	while(c<=57&&c>=48){
		out=(out<<1)+(out<<3)+c-48;
		c=getchar();
	}
	return out;
}
inline void write(ll x){
	if(x>9) write(x/10);
	putchar(x%10+48);
}
const int p=10000; 
struct Edge{int v;ll w;};
vector<Edge>edge[MAXN];
ll dis[MAXN],num[MAXN];
int fa[MAXN];
int n,m,s,t;
ll t0;
void init(){
	n=read(),m=read(),s=read(),t=read(),t0=read();
	for(int i=1;i<=m;++i){
		int u=read();
		int v=read();
		int w=read();
		if(u!=v){
			edge[u].push_back(Edge{v,w});
			++fa[v];
		}
	}
	num[s]=1;
}
void dfs(int u){
	for(int i=0;i<edge[u].size();++i){
		int v=edge[u][i].v;
		dis[v]=(dis[v]+(dis[u]+(num[u]*edge[u][i].w)%p)%p)%p;
		num[v]+=num[u];
		--fa[v];
		if(fa[v]==0) dfs(v);
	}
}
int main(){
	init();
	dfs(s);
	write((dis[t]+((num[t]-1)*t0)%p)%p);
	return 0;
}