E

//bellman_ford判断负环
#include <vector>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

const int maxn = 200 + 5;

int n,m;
double v;
struct node{
    int u, v;
    double r,c;
}p[maxn];

double dis[maxn];
int cnt;

bool bellman_ford(int x){
    memset(dis, 0, sizeof(dis));
    dis[x] = v;
    for(int i = 1;i < n;i++){
        bool flag = true;
        for(int j = 0;j < cnt;j++){
            int aa = p[j].u;
            int bb = p[j].v;
            double rr = p[j].r;
            double cc = p[j].c;
            if(dis[bb] < (dis[aa] - cc)*rr){
                dis[bb] = (dis[aa] - cc)*rr;
                flag = false;
            }
        }
        if(flag)
            break;
    }

    //判断出现负环
    for(int i = 0; i< cnt;i++)
        if( dis[p[i].v] < (dis[p[i].u]-p[i].c)*p[i].r)
            return true;
    return false;
}

int main(){
    int s;
    cin >> n >> m >> s >>v;
    cnt = 0;
    while(m--){
        int a, b;
        double c1,r1,c2,r2;
        cin >> a >> b >> c1 >> r1 >> c2 >> r2;
        p[cnt].u = a, p[cnt].v = b, p[cnt].r = c1, p[cnt++].c = r1;
        p[cnt].u = b, p[cnt].v = a, p[cnt].r = c2, p[cnt++].c = r2;
    }
    if(bellman_ford(s))
        cout << "YES" << endl;
    else
        cout << "NO" << endl;

    return 0;
}