#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=200+5,M=(1<<28)+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,m,S,T,X[N*N],Y[N*N],Z[N*N],in[N];
ll mpow(ll x,int y=mod-2){ll ans=1;while(y) y&1&&(ans=ans*x%mod),y>>=1,x=x*x%mod;return ans;}
ll A[N][N],p[N],f[N],g[N];
void Gauss(ll *ans){
	for(int i=1;i<=2*n;i++){
		for(int j=i+1;j<=2*n;j++) if(A[j][i]){swap(A[i],A[j]);break;}
		ll w=mpow(A[i][i]);for(int j=i;j<=2*n+1;j++) (A[i][j]*=w)%=mod;
		for(int j=i+1;j<=2*n;j++){
			w=mod-A[j][i];
			for(int h=i;h<=2*n+1;h++) (A[j][h]+=w*A[i][h])%=mod;
		}
	}
	for(int i=2*n;i;i--){
		ans[i]=mod-A[i][2*n+1];
		for(int j=i+1;j<=2*n;j++) (ans[i]+=(mod-A[i][j])*ans[j])%=mod;
		ans[i]%=mod;
	}
}
void Solve(){
	scanf("%d%d%d%d",&n,&m,&S,&T);
	for(int i=1;i<=m;i++) scanf("%d%d%d",&X[i],&Y[i],&Z[i]),in[X[i]]++;
	for(int i=1;i<=n;i++) in[i]=mpow(in[i]);
	Me(A,0);
	for(int i=1;i<=n;i++) A[i][i]=A[i+n][i+n]=1;
	A[T][2*n+1]=mod-1;
	for(int i=1;i<=m;i++)if(X[i]^T){
		int a=Y[i],b=X[i];
		if(Z[i]){
			(A[b][a]+=mod-in[b])%=mod;
			(A[b+n][a+n]+=mod-in[b])%=mod;
		}else{
			(A[b+n][a]+=mod-in[b])%=mod;
			(A[b+n][a+n]+=mod-in[b])%=mod;
		}
	}
	Gauss(p);
	gdb(p[1],p[2],p[3],p[4]);
	Me(A,0);
	for(int i=1;i<=n;i++) A[i][i]=A[i+n][i+n]=1;
	for(int i=1;i<=m;i++)if(X[i]^T){
		int a=Y[i],b=X[i];
		if(Z[i]){
			(A[b][a]+=mod-in[b])%=mod;(A[b][2*n+1]+=p[a]*(mod-in[b]))%=mod;
			(A[b+n][a+n]+=mod-in[b])%=mod;(A[b+n][2*n+1]+=p[a+n]*(mod-in[b]))%=mod;
		}else{
			(A[b+n][a]+=mod-in[b])%=mod;(A[b+n][2*n+1]+=p[a]*(mod-in[b]))%=mod;
			(A[b+n][a+n]+=mod-in[b])%=mod;(A[b+n][2*n+1]+=p[a+n]*(mod-in[b]))%=mod;
		}
	}
	Gauss(f);
	ll ans1=(f[S]+f[S+n])%mod;
	printf("%lld ",ans1);
	/*for(int i=1;i<=n;i++) A[i][i]=A[i+n][i+n]=A[i+2*n][i+2*n]=A[i+3*n][i+3*n]=1;
	for(int i=1;i<=m;i++)if(X[i]^T){
		int a=Y[i],b=X[i];
		if(Z[i]){
			for(int o:{0,2*n}){
				(A[b+o][a+o]+=mod-in[b])%=mod;(A[b+o][4*n+1]+=mod-in[b])%=mod;
				(A[b+o+n][a+o+n]+=mod-in[b])%=mod;(A[b+o+n][a+o]+=2*(mod-in[b]))%=mod;(A[b+o+n][4*n+1]+=mod-in[b])%=mod;
			}
		}else{
			for(int o:{0,2*n}){
				(A[b+2*n][a+o]+=mod-in[b])%=mod;
				(A[b+3*n][a+o+n]+=mod-in[b])%=mod;
			}
		}
	}
	Gauss();
	gdb(ans[S],ans[S+2*n]);
	ll ans1=(ans[S]+ans[S+2*n])%mod,ans2=(ans[S+n]+ans[S+3*n]+(mod-ans1)*ans1)%mod;
	printf("%lld %lld\n",ans1,ans2);*/
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}