RT

#include <bits/stdc++.h>
#define MAX 101001
using namespace std;
int n,m,s,t,ans;
struct node{
	int w,to,nxt;
}edge[MAX];
int head[MAX],cur[MAX],dep[MAX];
bool vis[MAX];
int cnt=1,ff; 
void add(int u, int v, int w) {
	edge[++cnt].to=v;
	edge[cnt].w=w;
	edge[cnt].nxt=head[u];
	head[u]=cnt;
}
bool bfs() {
	for (int i=s;i<=t;i++) {
		cur[i]=head[i];
		vis[i]=0;
		dep[i]=0x3f3f3f3f;
	}
	queue<int>q;
	q.push(s);
	vis[s]=1;
	dep[s]=0;
	while(!q.empty()) {
		int u=q.front();
		q.pop();
		vis[u]=false;
		for (int i=head[u];i;i=edge[i].nxt) {
			int v=edge[i].to;
			if (dep[v]>dep[u]+1&&edge[i].w) {
				dep[v]=dep[u]+1;
				if (!vis[v]) {
					vis[v]=1;
					q.push(v);
				}
			}
		}
	}
	return (dep[t]!=0x3f3f3f3f);
}
int dfs(int u, int flow) {
	if (u==t) {
		ans+=flow;
		return flow;
	}
	int rlow=0,used=0;
	for (int i=cur[u];i;i=edge[i].nxt) {
		cur[u]=i;
		int v=edge[i].to;
		if (dep[v]==dep[u]+1&&edge[i].w){
			if (rlow=dfs(v,min(flow-used,edge[i].w))) {
				used+=rlow;
				edge[i].w-=rlow;
				edge[i^1].w+=rlow;
				if (used==flow) break;
			}
		}
	}
	return used;
}
void dinic() {
	while(bfs()) {
		dfs(s,INT_MAX);
	}
}
int main(){
	while(scanf("%d",&n)!=EOF&&n) {
		ff++;
		memset(edge,0,sizeof(edge));
		memset(head,0,sizeof(head));
		ans=0;
		cnt=1;
		scanf("%d%d%d",&s,&t,&m);
		for (int i=1;i<=m;i++) {
			int x,y,z;
			scanf("%d%d%d",&x,&y,&z);
			add(x,y,z);
			add(y,x,0);
			add(y,x,z);
			add(x,y,0);
		}
		dinic();
		printf("Network %d\nThe bandwidth is %d.\n",ff,ans);
	}
	return 0;
}