#include <stdio.h>

 #include <string.h>

 #include <queue>

 using namespace std;

 int m,n,p,head[  ],pos,num[  ];

 bool vis[  ];

 double val,dist[  ];

 struct note{

     int v,next;

     double r,c;

 }edge[  ];

 void add(int x,int v,double r,double c)

 {

     edge[ pos ].v = v;

     edge[ pos ].r = r;

     edge[ pos ].c = c;

     edge[ pos ].next = head[ x ];

     head[ x ] = pos ++;

 }

 bool spfa()

 {

     queue<int >s;

     s.push(p);

     dist[ p ] = val;

     vis[ p ] = true;

     num[ p ] ++;

     while(!s.empty())

     {

         int tmp = s.front();

         s.pop();

         vis[ tmp ] = false;

         for( int i = head[ tmp ] ; i != - ; i = edge[ i ].next)

         {

             if( dist[ edge[ i ].v ] < (dist[ tmp ] - edge[ i ].c ) * edge[ i ].r )

             {

                 dist[ edge[ i ].v ] = (dist[ tmp ] - edge[ i ].c ) * edge[ i ].r;

                 if( !vis[ edge[ i ].v ] )

                 {

                     s.push( edge[ i ].v );

                     vis[ edge[ i ].v ] = true;

                     num[ edge[ i ].v ] ++;     //可能构成正权回路，这个是用来判断的。但次数比m次要大的时候，就肯定是增多的。可以直接return 。

                     if( num[edge[ i ].v] > m)

                         return true;

                 }

             }

         }

     }

     if( dist[ p ] > val ) return true;   //如果之后的钱比之前的多，也return true.

     return false;

 }

 int main()

 {

    // freopen("in.txt","r",stdin);

     int a,b;

     double r1,c1,r2,c2;

     pos = ;

     memset( head , - , sizeof( head ) );

     memset( dist ,  , sizeof( dist ) );

     memset( vis , false ,sizeof( vis ) );

     memset( num ,  , sizeof( num ) );

     scanf("%d%d%d%lf",&m,&n,&p,&val);

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

     {

         scanf("%d%d%lf%lf%lf%lf",&a,&b,&r1,&c1,&r2,&c2);

         add(a,b,r1,c1);

         add(b,a,r2,c2);

     }

     if(spfa()) printf("YES\n");

     else printf("NO\n");

     return ;

 }