#include<cstdio>

 #include<cstring>

 #include<vector>

 #include<algorithm>

 #include<queue>

 using namespace std;

 #define INF 2147483647

 #define MAXN 4011

 #define MAXM 120101

 int v[MAXM],cap[MAXM],en,first[MAXN],next[MAXM];

 int d[MAXN],cur[MAXN],cmp[MAXN],sum;

 bool vis[MAXN];

 queue<int>q;

 vector<int>vs;

 int n,m,S,T,A,B,C;

 void Init_Dinic(){memset(first,-,sizeof(first)); en=;}

 void AddEdge(const int &U,const int &V,const int &W)

 {v[en]=V; cap[en]=W; next[en]=first[U]; first[U]=en++;

 v[en]=U; next[en]=first[V]; first[V]=en++;}

 bool bfs()

 {

     memset(d,-,sizeof(d)); q.push(S); d[S]=;

     while(!q.empty())

       {

         int U=q.front(); q.pop();

         for(int i=first[U];i!=-;i=next[i])

           if(d[v[i]]==- && cap[i])

             {

               d[v[i]]=d[U]+;

               q.push(v[i]);

             }

       }

     return d[T]!=-;

 }

 int dfs(int U,int a)

 {

     if(U==T || !a) return a;

     int Flow=,f;

     for(int &i=cur[U];i!=-;i=next[i])

       if(d[U]+==d[v[i]] && (f=dfs(v[i],min(a,cap[i]))))

         {

           cap[i]-=f; cap[i^]+=f;

           Flow+=f; a-=f; if(!a) break;

         }

     if(!Flow) d[U]=-;

     return Flow;

 }

 void max_flow()

 {

     while(bfs())

       {

         memcpy(cur,first,(n+)*sizeof(int));

         while(dfs(S,INF));

       }

 }

 void dfs(int U)

 {

     vis[U]=;

     for(int i=first[U];i!=-;i=next[i]) if(cap[i]&&(!vis[v[i]])) dfs(v[i]);

     vs.push_back(U);

 }

 void dfs2(int U)

 {

     cmp[U]=sum;

     for(int i=first[U];i!=-;i=next[i]) if(cap[i^]&&(!cmp[v[i]])) dfs2(v[i]);

 }

 void scc()

 {

     for(int i=;i<=n;i++) if(!vis[i]) dfs(i);

     vector<int>::iterator it=vs.end(); --it;

     for(;;--it)

       {

         if(!cmp[*it]) {++sum; dfs2(*it);}

         if(it==vs.begin()) break;

       }

 }

 int main()

 {

     scanf("%d%d%d%d",&n,&m,&S,&T); Init_Dinic();

     for(;m;--m)

       {

           scanf("%d%d%d",&A,&B,&C);

           AddEdge(A,B,C);

       }

     max_flow(); scc();

     for(int i=;i<en;i+=)

       printf("%d %d\n",(!cap[i])&&cmp[v[i+]]!=cmp[v[i]],(!cap[i])&&cmp[v[i+]]==cmp[S]&&cmp[v[i]]==cmp[T]);

     return ;

 }