#include<cstdio>

 #include<iostream>

 #include<cstring>

 #define M 100009

 #define inf 2139062143

 using namespace std;

 int n,m,S,tot,cnt=,T,ans,head[],d[],q[*M],next[*M],u[*M],v[*M],a[*M][];

 bool bfs()

 {

     memset(d,,sizeof(d));

     int h=,t=;

     q[]=S;

     d[S]=;

     for(;h<t;)

       {

         h++;

         int p=q[h];

         for(int i=head[p];i;i=next[i])

           if(!d[u[i]]&&v[i])

             {

                 d[u[i]]=d[p]+;

                 if(d[T])

                   return ;

                 t++;

                 q[t]=u[i];

             }

       }

     return ;

 }

 int dinic(int s,int f)

 {

     if(s==T)

       return f;

     int rest=f;

     for(int i=head[s];i&&rest;i=next[i])

       if(v[i]&&d[u[i]]==d[s]+)

         {

             int now=dinic(u[i],min(rest,v[i]));

             if(!now)

               d[u[i]]=;

             v[i]-=now;

             v[i^]+=now;

             rest-=now;

         }

     return f-rest;

 }

 void jia1(int a1,int a2,int a3)

 {

     cnt++;

     next[cnt]=head[a1];

     head[a1]=cnt;

     u[cnt]=a2;

     v[cnt]=a3;

     return;

 }

 void jia(int a1,int a2,int a3)

 {

     jia1(a1,a2,a3);

     jia1(a2,a1,);

     return;

 }

 int main()

 {

     int s;

     scanf("%d%d",&n,&m);

     for(int i=;i<=m;i++)

       scanf("%d%d%d",&a[i][],&a[i][],&a[i][]);

     scanf("%d%d%d",&S,&T,&s);

     cnt=;

     memset(head,,sizeof(head));

     for(int i=;i<=m;i++)

       if(a[i][]>s)

         {

            jia(a[i][],a[i][],);

            jia(a[i][],a[i][],);

         }

     for(;bfs();)

       ans+=dinic(S,inf);

     cnt=;

     memset(head,,sizeof(head));

     for(int i=;i<=m;i++)

       if(a[i][]<s)

         {

           jia(a[i][],a[i][],);

           jia(a[i][],a[i][],);

         }

     for(;bfs();)

       ans+=dinic(S,inf);

     printf("%d\n",ans);

     return ;

 }