#include<stdio.h>

 #include<queue>

 #include<string.h>

 #define INF 999999

 using namespace std;

 int s,t,n,m;

 int map[][],flow[][];

 int p[],a[];

 int EK(int s,int t)

 {

     queue<int>q;

     int sum=;

     memset(flow,,sizeof(flow));

     while()

     {

         memset(a,,sizeof(a));

         a[s]=INF;

         q.push(s);

         while(!q.empty())

         {

             int u=q.front();

             q.pop();

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

             {

                 if(!a[i]&&flow[u][i]<map[u][i])

                 {

                     p[i]=u;

                     q.push(i);

                     a[i]=a[u]<map[u][i]-flow[u][i]?a[u]:map[u][i]-flow[u][i];

                 }

             }

         }

         if(!a[t])break;

         for(int i=t; i!=s; i=p[i])

         {

             flow[p[i]][i]+=a[t];

             flow[i][p[i]]-=a[t];

         }

         sum+=a[t];

     }

     return sum;

 }

 int main()

 {

     int cas=;

     while(scanf("%d",&m),m)

     {

         scanf("%d%d%d",&s,&t,&n);

         memset(map,,sizeof(map));

         int a,b,c;

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

         {

             scanf("%d%d%d",&a,&b,&c);

             map[a][b]+=c;

             map[b][a]=map[a][b];

         }

         int maxx=EK(s,t);

         printf("Network %d\n",cas++);

         printf("The bandwidth is %d.\n\n",maxx);

     }

     return ;

 }