Given a graph with N vertices numbered 1 to N and M edges, the task is to find the max flow from vertex 1 to vertex N.

**Input:**

The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. The first line of each test case contains two space separated integers N and M . Then in the next line are M space separated triplets x, y, z denoting an undirected edge from x to y with a flow capacity of z.

**Output:**

For each test case in a new line print a single integer denoting the maximum flow between 1 to N.

**Constraints:**

1<=T<=100

1<=N,M<=1000

**Example:
Input:**

2

5 4

1 2 1 3 2 2 4 2 3 2 5 5

4 4

1 2 8 1 3 10 2 4 2 3 4 3

1

5

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

shivam2303 | 254 |

:)) | 244 |

PankajChhabra1 | 242 |

codifica_amante | 212 |

Sanjali27 | 206 |

KapilChhipa | 602 |

Sanjali27 | 568 |

shivam2303 | 543 |

mb1973 | 519 |

sagarsagar | 512 |

blackshadows | 5254 |

Ibrahim Nash | 5192 |

akhayrutdinov | 5111 |

Quandray | 4385 |

mb1973 | 3956 |

Login to report an issue on this page.