Q2

Minimum Spanning Tree Check

Given two undirected weighted graphs G1 and G2, write a function named CheckMST which checks if G2 is a valid MST for G1. The function returns true when valid and false otherwise.

Input

Your function takes as input three integers: V, E1, and E2 where V is the number of Vertices, E1 is the number of edges for the first graph G1, and E2 is the number of edges for the second graph G2 and:

3 integer arrays for edges information for graph 1: From1[], To1[], Weight1[]

3 integer arrays for edges information for graph 2: From2[] ,To2[], Weight2[]

Output

Yes or No

Example 1:

V=4 E1=5 E2=4

Graph 1 info

From To Weight 0 1 4 0 2 5 0 3 2 1 2 7 2 3 8

Graph 2 info

From To Weight 0 1 4 0 2 5 0 3 2 1 2 7

Answer:

NO

Example 2:

V=4 E1=5 E2=4

Graph 1 info

From To Weight 0 1 4 0 2 5 0 3 2 1 2 7 2 3 8

Graph 2 info

From To Weight 0 1 4 0 2 5 0 3 2

Answer:

YES