7 9 999999999 0 3
0 1 0
1 2 0
2 3 0
0 4 1
4 1 1
1 5 499999999
5 2 499999999
2 6 1
6 3 1
 7 9 320 0 3
0 1 0
1 2 0
2 3 0
0 4 1
4 1 1
1 5 100
5 2 100
2 6 59
6 3 61
 4 5 7 0 3
0 1 0
1 2 3
2 3 0
0 2 5
1 3 5
 8 9 10 1 0
1 2 1
2 4 1
1 3 0
3 4 0
4 5 0
5 6 1
6 0 1
5 7 0
7 0 0
 4 4 14 1 3
1 3 13
2 3 0
2 0 0
1 0 12
 5 6 1000000000 0 4
0 1 1
2 0 2
3 0 3
4 1 0
4 2 0
3 4 0
 4 5 10 1 2
0 1 3
1 2 0
1 3 4
2 3 4
2 0 6
 4 4 2 1 3
1 3 13
2 3 0
2 0 0
1 0 0
 5 5 2 0 2
0 1 1
1 2 1
0 4 0
4 3 0
3 2 0
 5 5 3 0 2
0 1 1
1 2 1
0 4 0
4 3 0
3 2 0
 4 4 8 1 3
1 3 13
2 3 0
2 0 0
1 0 6
 1000 1 1000000000 998 0
0 999 0
 5 5 1 0 2
0 1 1
1 2 1
0 4 0
4 3 0
3 2 0
 100 1 123456 99 0
0 99 123456
 4 4 13 1 3
1 3 13
2 3 0
2 0 0
1 0 12
 7 9 319 0 3
0 1 0
1 2 0
2 3 0
0 4 1
4 1 1
1 5 100
5 2 100
2 6 59
6 3 61
 1000 1 5 999 0
0 999 0

YES
0 1 1
1 2 999999996
2 3 999999997
0 4 1
4 1 1
1 5 499999999
5 2 499999999
2 6 1
6 3 1
 YES
0 1 1
1 2 199
2 3 318
0 4 1
4 1 1
1 5 100
5 2 100
2 6 59
6 3 61
 YES
0 1 3
1 2 3
2 3 2
0 2 5
1 3 5
 YES
1 2 1
2 4 1
1 3 1
3 4 1
4 5 6
5 6 1
6 0 1
5 7 1
7 0 1
 NO YES
0 1 1
2 0 2
3 0 3
4 1 999999999
4 2 999999998
3 4 999999997
 NO NO YES
0 1 1
1 2 1
0 4 1
4 3 1
3 2 1
 NO YES
1 3 13
2 3 1
2 0 1
1 0 6
 NO NO YES
0 99 123456
 YES
1 3 13
2 3 1
2 0 1
1 0 12
 YES
0 1 1
1 2 198
2 3 317
0 4 1
4 1 1
1 5 100
5 2 100
2 6 59
6 3 61
 YES
0 999 5

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000;
const long long INF = 1e18;
vector<pair<int, int> > v[MAXN + 1];
priority_queue<pair<long long, int> > q;
long long dist[MAXN + 1];
int cnt = 0;
long long* ret;
long long value[10001];
bool ck[1001][1001];
bool change;
void djik(int s, int e, int I) {
  change = false;
  for (int i = 0; i < 1001; i++) dist[i] = INF;
  dist[s] = 0;
  q.push(make_pair(0LL, s));
  while (!q.empty()) {
    long long cost = -q.top().first;
    int x = q.top().second;
    q.pop();
    if (cost > dist[x]) continue;
    for (int i = 0; i < v[x].size(); i++) {
      if (value[v[x][i].second] >= INF && cnt < I) {
        ret = &value[v[x][i].second];
        *ret = 1;
        cnt++;
        change = true;
      }
      long long weight = cost + value[v[x][i].second];
      int next = v[x][i].first;
      if (dist[next] > weight) {
        dist[next] = weight;
        q.push(make_pair(-weight, next));
      }
    }
  }
}
int main() {
  int n, m, L, s, e, cc;
  scanf("%d %d %d %d %d", &n, &m, &L, &s, &e);
  for (int i = 0; i < m; i++) {
    int a, b;
    long long w;
    scanf("%d %d %lld", &a, &b, &w);
    if (w == 0) w = 1e18;
    value[i] = w;
    v[a].push_back(make_pair(b, i));
    v[b].push_back(make_pair(a, i));
  }
  djik(s, e, 0);
  if (dist[e] < L) {
    printf("NO");
    return 0;
  }
  for (int i = 0; i < n; i++) {
    djik(s, e, i);
    if (dist[e] <= L) {
      printf("YES\n");
      if (change) *ret += L - dist[e];
      for (int j = 0; j < n; j++) {
        for (int k = 0; k < v[j].size(); k++) {
          if (!ck[j][v[j][k].first])
            printf("%d %d %lld\n", j, v[j][k].first, value[v[j][k].second]);
          ck[j][v[j][k].first] = ck[v[j][k].first][j] = true;
        }
      }
      return 0;
    }
  }
  printf("NO");
}
