首先考虑让L出现在最小生成树中。则边权比L小的所有边不能使得u,v联通。否则加入L,在环上一定是去掉L最优。所以跑个最小割就是答案。最大生成树同理,两个答案相加就是答案。
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 20010
#define M 200010
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*f;
}
int n,m,h[N],num=1,S,T,len,lev[N],cur[N],ans=0;
struct edge{
int to,next,val;
}data[M<<1];
struct Edge{
int x,y,val;
}e[M];
inline bool cmp(Edge x,Edge y){return x.val<y.val;}
inline void add(int x,int y,int val){
data[++num].to=y;data[num].next=h[x];h[x]=num;data[num].val=val;
data[++num].to=x;data[num].next=h[y];h[y]=num;data[num].val=val;
}
inline bool bfs(){
queue<int>q;memset(lev,0,sizeof(lev));
q.push(S);lev[S]=1;
while(!q.empty()){
int x=q.front();q.pop();
for(int i=h[x];i;i=data[i].next){
int y=data[i].to;if(lev[y]||!data[i].val) continue;
lev[y]=lev[x]+1;if(y==T) return 1;q.push(y);
}
}return 0;
}
inline int dinic(int x,int low){
if(x==T) return low;int tmp=low;
for(int &i=cur[x];i;i=data[i].next){
int y=data[i].to;if(lev[y]!=lev[x]+1||!data[i].val) continue;
int res=dinic(y,min(data[i].val,tmp));
if(!res) lev[y]=0;else tmp-=res,data[i].val-=res,data[i^1].val+=res;
if(!tmp) return low;
}return low-tmp;
}
int main(){
// freopen("a.in","r",stdin);
n=read();m=read();
for(int i=1;i<=m;++i) e[i].x=read(),e[i].y=read(),e[i].val=read();
sort(e+1,e+m+1,cmp);S=read();T=read();len=read();
for(int i=1;i<=m;++i)
if(e[i].val<len) add(e[i].x,e[i].y,1);
else break;
while(bfs()){memcpy(cur,h,sizeof(cur));ans+=dinic(S,inf);}
memset(h,0,sizeof(h));num=1;
for(int i=m;i>=1;--i)
if(e[i].val>len) add(e[i].x,e[i].y,1);
else break;
while(bfs()){memcpy(cur,h,sizeof(cur));ans+=dinic(S,inf);}
printf("%d\n",ans);
return 0;
}