#include<cstdio>

#include<cstring>

#include<vector>

#include<queue>

#include<algorithm>

#include<cmath>

using namespace std;

const int maxn = ;

#define inf 1<<30

int n;

int a[maxn],p[maxn];

struct edge

{

    int from,to,w,cap,flow;

    edge(int from,int to,int cap,int flow):from(from),to(to),cap(cap),flow(flow){

    }

};

vector<edge> edges;

vector<int> g[maxn];

void init(int k)

{

            for(int i=;i<=k;i++)g[i].clear();

        edges.clear();

}

void addedge(int from,int to,int cap)

{

    edges.push_back(edge(from,to,cap,));

    edges.push_back(edge(to,from,cap,));

    int m=edges.size();

    g[from].push_back(m-);

    g[to].push_back(m-);

}

int Max_flow(int s,int t)

{

    int flow=;

    while()

    {

        queue<int> q;

        memset(a,,sizeof(a));

        q.push(s);

        a[s]=inf;

        while(!q.empty())

        {

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

            for(int i=;i<g[x].size();i++)

            {

                edge &e=edges[g[x][i]];

                if(!a[e.to]&&e.cap>e.flow)

                {

                    p[e.to]=g[x][i];

                    a[e.to]= min(a[x],e.cap-e.flow);

                    q.push(e.to);

                }

            }

            if(a[t])break;

        }

        if(!a[t])break;

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

        {

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

            edges[p[i]^].flow-=a[t];

        }

        flow+=a[t];

    }

    return flow;

}

int main()

{

    int cas = ;

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

    {

        int s,t,c;

        int u,v,cap;

        init(n);

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

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

        {

            scanf("%d%d%d",&u,&v,&cap);

            addedge(u,v,cap);

        }

        printf("Network %d\nThe bandwidth is %d.\n\n",++cas,Max_flow(s,t));

    }

}