Problem: Levko loves sports pathfinding competitions in his city very much. In order to boost his performance, Levko spends his spare time practicing. The practice is a game.

The city consists of n intersections connected by m + k directed roads. Two or more roads can connect the same pair of intersections. Besides, there can be roads leading from an intersection to itself. 

Levko and Zenyk are playing a game. First Levko stands on intersection s1, and Zenyk stands on intersection s2. They both want to get to intersection f. The person who does it quicker wins. If they get there at the same time, the game ends with a draw. By agreement both players start simultaneously and move with the same speed.

Levko wants to win very much. He knows the lengths of all the roads in the city. Also he knows that he can change the lengths of some roads (there are k such roads at all) if he pays the government. So, the government can change the length of the i-th road to any integer value in the segment [li, ri] (both borders inclusive). Levko wondered if he can reconstruct the roads so as to win the game and whether he can hope for the draw if he cannot win.

You should consider that both players play optimally well. It is guaranteed that we can get from intersections s1 and s2 to intersection f. 

Input

The first line contains three integers n, m and k (1 ≤ n, m ≤ 104, 1 ≤ k ≤ 100). The second line contains three integers s1, s2 and f (1 ≤ s1, s2, f ≤ n).

The next m lines contains the descriptions of the roads that cannot be changed by Levko. Each line contains three integers ai, bi and ci (1 ≤ ai, bi ≤ n, 1 ≤ ci ≤ 109), representing a road from intersection ai to intersection bi of length ci.

The next k lines contains the descriptions of the roads that can be changed by Levko. Each line contains four integers ai, bi, li and ri (1 ≤ ai, bi ≤ n, 1 ≤ li ≤ ri ≤ 109), representing a road from intersection ai to intersection bi, Levko can set the road's length within limits [li, ri].

Consider all intersections numbered from 1 to n. It is guaranteed that you can get from intersections s1 and s2 to intersection f.

Output

In the first line print string "WIN" (without the quotes) if Levko can win this game, string "DRAW" (without the quotes) if Levko can end the game with a draw and "LOSE" (without the quotes) if he loses for sure.

If the answer is "WIN" or "DRAW", then print on the second line k space-separated integers — the length of the roads Levko sets in the order they occur in the input.

Examples

Input

4 1 3
1 3 4
3 2 2
1 2 1 3
2 4 1 3
3 4 1 3


Output

WIN
1 1 3 

Input

4 1 3
1 3 4
3 2 2
1 2 1 3
2 4 1 3
3 4 1 2


Output

DRAW
1 1 2 

Input

5 4 2
1 2 5
1 3 3
1 4 4
2 3 2
2 4 3
3 5 1 5
4 5 4 7


Output

LOSE

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int NMax = 10005;
const long long INF = 10000000000000005;
const int KMax = 105;
int N, M, K;
pair<int, int> E[KMax], X[KMax];
vector<pair<int, int> > G[NMax];
vector<int> Change[NMax];
pair<int, int> newVal[NMax];
int From[NMax];
int S1, S2, F;
bool useEdge[NMax];
int Res[NMax], ResDraw[NMax];
priority_queue<pair<int, int>, vector<pair<int, int> >,
               greater<pair<int, int> > >
    Q;
bool Use[NMax];
long long Dist[2][NMax];
void Read() {
  scanf("%d%d%d", &N, &M, &K);
  scanf("%d%d%d", &S1, &S2, &F);
  for (int i = 1; i <= M; i++) {
    int x, y, c;
    scanf("%d%d%d", &x, &y, &c);
    G[x].push_back(make_pair(y, c));
    Change[x].push_back(0);
  }
  for (int i = 1; i <= K; i++) {
    int x, y, l, r;
    scanf("%d%d%d%d", &x, &y, &l, &r);
    X[i] = make_pair(x, y);
    E[i] = make_pair(l, r);
    G[x].push_back(make_pair(y, r));
    Change[x].push_back(i);
  }
}
void init(int ind) {
  while (!Q.empty()) Q.pop();
  for (int i = 1; i <= N; i++) Use[i] = false;
  for (int i = 1; i <= N; i++) Dist[ind][i] = INF;
}
int findMin() {
  while (!Q.empty() && Use[Q.top().second] == 1) Q.pop();
  if (Q.empty()) return 0;
  int res = Q.top().second;
  Q.pop();
  return res;
}
void Dijkstra(int ind, int source) {
  init(ind);
  Dist[ind][source] = 0;
  Q.push(make_pair(0, source));
  for (int step = 1; step < N && !Q.empty(); step++) {
    int node = findMin();
    if (node == 0) return;
    Use[node] = true;
    for (int i = 0; i < G[node].size(); i++) {
      int neighb = G[node][i].first, cost = G[node][i].second;
      int change = Change[node][i];
      if (change != 0) {
        cost = Res[change];
      }
      if (!Use[neighb] && Dist[ind][neighb] > Dist[ind][node] + cost) {
        Dist[ind][neighb] = Dist[ind][node] + cost;
        Q.push(make_pair(Dist[ind][neighb], neighb));
      }
    }
  }
}
bool solveForWin() {
  for (int i = 1; i <= K; i++) Res[i] = E[i].second, useEdge[i] = false;
  while (true) {
    Dijkstra(0, S1);
    Dijkstra(1, S2);
    bool change = false;
    for (int i = 1; i <= K; i++) {
      if (useEdge[i]) continue;
      int x = X[i].first, y = X[i].second;
      int l = E[i].first;
      if (Dist[0][x] < Dist[1][x]) {
        Res[i] = l;
        change = true;
        useEdge[i] = true;
        break;
      }
    }
    if (!change) break;
  }
  if (Dist[0][F] >= Dist[1][F]) return false;
  printf("WIN\n");
  for (int i = 1; i <= K; i++) printf("%d ", Res[i]);
  printf("\n");
  return true;
}
bool solveForEqual() {
  for (int i = 1; i <= K; i++) Res[i] = E[i].second, useEdge[i] = false;
  while (true) {
    Dijkstra(0, S1);
    Dijkstra(1, S2);
    bool change = false;
    for (int i = 1; i <= K; i++) {
      if (useEdge[i]) continue;
      int x = X[i].first, y = X[i].second;
      int l = E[i].first;
      if (Dist[0][x] <= Dist[1][x]) {
        Res[i] = l;
        change = true;
        useEdge[i] = true;
        break;
      }
    }
    if (!change) break;
  }
  if (Dist[0][F] > Dist[1][F]) return false;
  printf("DRAW\n");
  for (int i = 1; i <= K; i++) printf("%d ", Res[i]);
  printf("\n");
  return true;
}
int main() {
  Read();
  if (solveForWin()) return 0;
  if (solveForEqual()) return 0;
  printf("LOSE\n");
  return 0;
}