#include <bits/stdc++.h>
using namespace std;
struct node {
  long long u, v, l, r, id, ins;
} a[10110 * 2];
struct nod {
  long long next, to, w;
} e[10110 * 2];
struct no {
  long long id, val;
  bool operator<(const no &x) const { return val > x.val; }
};
long long n, m, k, t, s1, s2, tot, head[10110], vis[10110], dis[2][10110];
priority_queue<no> q;
void adde(long long u, long long v, long long w) {
  e[++tot].next = head[u];
  e[tot].to = v;
  e[tot].w = w;
  head[u] = tot;
}
void djk(long long s) {
  for (long long i = 1; i <= n; i++) dis[s][i] = 4e18;
  memset(vis, 0, sizeof(vis));
  long long x = s == 0 ? s1 : s2;
  q.push((no){x, 0});
  dis[s][x] = 0;
  while (!q.empty()) {
    long long u = q.top().id;
    q.pop();
    if (vis[u]) continue;
    vis[u] = 1;
    for (long long i = head[u]; i; i = e[i].next) {
      long long v = e[i].to;
      if (dis[s][v] > dis[s][u] + e[i].w) {
        dis[s][v] = dis[s][u] + e[i].w;
        q.push((no){v, dis[s][v]});
      }
    }
  }
}
signed main() {
  scanf("%lld%lld%lld%lld%lld%lld", &n, &m, &k, &s1, &s2, &t);
  for (long long i = 1, u, v, w; i <= m; i++) {
    scanf("%lld%lld%lld", &u, &v, &w);
    adde(u, v, w);
  }
  for (long long i = 1; i <= k; i++) {
    scanf("%lld%lld%lld%lld", &a[i].u, &a[i].v, &a[i].l, &a[i].r);
    a[i].id = tot + 1;
    a[i].ins = 1;
    adde(a[i].u, a[i].v, a[i].r);
  }
  djk(0);
  djk(1);
  while (dis[0][t] >= dis[1][t]) {
    long long now = 4e18;
    for (long long i = 1; i <= k; i++) {
      if (dis[0][a[i].u] <= dis[1][a[i].u] && a[i].ins) {
        now = i;
        break;
      }
    }
    if (now == 4e18) {
      if (dis[0][t] > dis[1][t]) {
        puts("LOSE");
        return 0;
      } else {
        puts("DRAW");
        for (long long j = 1; j <= k; j++)
          printf("%lld ", a[j].ins ? a[j].r : a[j].l);
        return 0;
      }
    }
    a[now].ins = 0;
    e[a[now].id].w = a[now].l;
    djk(0);
    djk(1);
  }
  puts("WIN");
  for (long long i = 1; i <= k; i++)
    printf("%lld ", a[i].ins ? a[i].r : a[i].l);
  return 0;
}
