#include<cstdio>

#include<cstring>

#include<algorithm>

#include<queue>

#define ll long long

using namespace std;

const int N=1e4+,M=;

int n,m,t,hd[N],xnt,bh[M],l[M],r[M],s1,s2,F;

ll dis1[N],dis2[N];bool vis[N],ans[M];

priority_queue<pair<ll,int> > q;

struct Ed{

  int x,to,nxt,w;

  Ed(int f=,int a=,int b=,int c=):x(f),to(a),nxt(b),w(c) {}

}ed[N+M];

int rdn()

{

  int ret=;bool fx=;char ch=getchar();

  while(ch>''||ch<''){if(ch=='-')fx=;ch=getchar();}

  while(ch>=''&&ch<='')ret=ret*+ch-'',ch=getchar();

  return fx?ret:-ret;

}

void add(int x,int y,int z){ed[++xnt]=Ed(x,y,hd[x],z);hd[x]=xnt;}

void dj()

{

  memset(dis1,0x3f,sizeof dis1);dis1[s1]=;

  memset(vis,,sizeof vis);

  q.push(make_pair(,s1));

  while(q.size())

    {

      int k=q.top().second;q.pop();

      if(vis[k])continue;vis[k]=;

      for(int i=hd[k],v;i;i=ed[i].nxt)

    if(dis1[v=ed[i].to]>dis1[k]+ed[i].w)

      dis1[v]=dis1[k]+ed[i].w,q.push(make_pair(-dis1[v],v));

    }

  memset(dis2,0x3f,sizeof dis2);dis2[s2]=;

  memset(vis,,sizeof vis);

  q.push(make_pair(,s2));

  while(q.size())

    {

      int k=q.top().second;q.pop();

      if(vis[k])continue;vis[k]=;

      for(int i=hd[k],v;i;i=ed[i].nxt)

    if(dis2[v=ed[i].to]>dis2[k]+ed[i].w)

      dis2[v]=dis2[k]+ed[i].w,q.push(make_pair(-dis2[v],v));

    }

}

int main()

{

  n=rdn();m=rdn();t=rdn();

  s1=rdn();s2=rdn();F=rdn();

  for(int i=,u,v,z;i<=m;i++)

    u=rdn(),v=rdn(),z=rdn(),add(u,v,z);

  for(int i=,u,v;i<=t;i++)

    {

      u=rdn();v=rdn();l[i]=rdn();r[i]=rdn();

      add(u,v,r[i]); bh[i]=xnt;

    }

  bool flag;

  while()

    {

      dj();flag=;

      for(int i=,d;i<=t;i++)

    {

      d=bh[i];

      if(ed[d].w==l[i]||dis1[ed[d].x]>dis2[ed[d].x])continue;

      ed[d].w=l[i];ans[i]=;flag=;

    }

      if(!flag)break;

    }

  dj();

  if(dis1[F]>dis2[F]){puts("LOSE");return ;}

  if(dis1[F]==dis2[F])puts("DRAW"); else puts("WIN");

  for(int i=;i<=t;i++)printf("%d ",ans[i]?l[i]:r[i]);puts("");

  return ;

}