#include<iostream>

 #include<stack>

 #include<vector>

 #include<queue>

 #include<algorithm>

 #include<cstdio>

 using namespace std;

 const int maxn = ;

 struct node{

     int to;

     double r;

     double c;

 };

 vector< node > e[maxn];

 int n,m,num;

 double money;

 double d[maxn];

 int inq[maxn];

 bool spfa(int s){

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

         inq[i] = d[i] = ;

     }

     queue<int>Q;

     Q.push(s);

     d[s] = money;

     inq[s] = ;

     while( !Q.empty() ){

         int now = Q.front();

         Q.pop();

         inq[now] = ;

         for(int i = ; i < e[now].size() ; i++){

             double rate = e[now][i].r;

             double commis = e[now][i].c;

             int v = e[now][i].to;

             if(d[v] < (d[now] - commis) * rate){

                 d[v] = (d[now] - commis) * rate;

                 if(inq[v] == ){

                     inq[v] = ;

                     Q.push(v);

                 }

             }

             if(d[s] > money){

                 return true;

             }

         }

     }

     return false;

 }

 int main() {

     scanf("%d%d%d%lf",&n,&m,&num,&money);

     int x,y;

     double r,c;

     while(m--){

         scanf("%d%d%lf%lf",&x,&y,&r,&c);

         e[x].push_back((node){y,r,c});

         scanf("%lf%lf",&r,&c);

         e[y].push_back((node){x,r,c});

     }

     if(spfa(num))

         cout<<"YES"<<endl;

     else

         cout<<"NO"<<endl;   

     return ;

 }