import networkx as nx
import matplotlib.pyplot as plt


def kruskal(G, make, mx=False):
    if make:
        sp = []
        n = len(G.nodes.items())
        for (u, v, wt) in G.edges.data('weight'):
            sp.append((u, v, wt))
        if not mx:
            sp.sort(key=lambda x: x[2])
            comp = [i for i in range(n)]
            ans = 0
            spp = {}
            x = []
            for start, end, weight in sp:
                start -= 1
                end -= 1
                if comp[start] != comp[end]:
                    ans += weight
                    a = comp[start]
                    b = comp[end]
                    for i in range(n):
                        if comp[i] == b:
                            comp[i] = a
                    spp[(start + 1, end + 1)] = weight
                    x.append((start + 1, end + 1))
            return spp, ans, x
        else:
            sp.sort(key=lambda x: -x[2])
            comp = [i for i in range(n)]
            ans = 0
            spp = {}
            x = []
            for start, end, weight in sp:
                start -= 1
                end -= 1
                if comp[start] != comp[end]:
                    ans += weight
                    a = comp[start]
                    b = comp[end]
                    for i in range(n):
                        if comp[i] == b:
                            comp[i] = a
                    spp[(start + 1, end + 1)] = weight
                    x.append((start + 1, end + 1))
            return spp, ans, x
    return (0, 0, 0)


G = nx.Graph()
make_graph = True
with open("inputkr.txt") as f:
    sp = f.readlines()
    n, m = [int(x) for x in sp[0].strip().split()]
    check = len(sp)
    node_sp = [i for i in range(1, n + 1)]
    n_cnt = 0
    m_cnt = 0
    for i in range(1, check):
        s = [int(x) for x in sp[i].strip().split()]
        if i >= n + 1:
            for i in range(len(s)):
                if s[i] not in node_sp and i < 2:
                    make_graph = False
                    print("Введена несуществующая вершина")
        if len(s) == 2:
            n_cnt += 1
        if len(s) == 3:
            m_cnt += 1
    if n_cnt < n:
        print("Введены не все вершины")
        make_graph = False
    if n_cnt > n:
        print("Введено больше вершин чем указано")
        make_graph = False
    if m_cnt < m:
        print("Введены не все ребра")
        make_graph = False
    if m_cnt > m:
        print("Введено больше ребер чем указано")
        make_graph = False
    if make_graph:
        for i in range(1, n + 1):
            posx, posy = [int(x) for x in sp[i].strip().split()]
            G.add_node(i, pos=(posx, posy))
        for i in range(n + 1, check):
            first_point, second_point, w = [int(x) for x in sp[i].strip().split()]
            G.add_edge(first_point, second_point, weight=w)

# G.add_node(1, pos=(0, 4))
# G.add_node(2, pos=(2, 3))
# G.add_node(3, pos=(4, 0))
# G.add_node(4, pos=(2, -3))
# G.add_node(5, pos=(0, -4))
# G.add_node(6, pos=(-3, -2))
# G.add_node(7, pos=(-4, 0))
# G.add_node(8, pos=(-3, 2))
#
# G.add_edge(1, 2, weight=2)
# G.add_edge(1, 8, weight=1)
#
# G.add_edge(2, 4, weight=1)
# G.add_edge(2, 6, weight=3)
# G.add_edge(2, 8, weight=3)
#
# G.add_edge(3, 4, weight=2)
# G.add_edge(3, 7, weight=6)
#
# G.add_edge(4, 5, weight=2)
# G.add_edge(4, 8, weight=3)
#
# G.add_edge(5, 6, weight=1)

sp, ans, spp = kruskal(G, make_graph)

if make_graph:
    pos = nx.get_node_attributes(G, 'pos')
    labels = nx.get_edge_attributes(G, 'weight')

    nx.draw(G, pos, with_labels=True, font_weight='bold', font_color="white", font_size=14)
    nx.draw_networkx_nodes(G, pos, node_size=400, node_color="black")

    nx.draw_networkx_edges(G, pos, edge_color="blue", edgelist=spp)
    nx.draw_networkx_edge_labels(G, pos, edge_labels=labels, font_size=16)
    nx.draw_networkx_edge_labels(G, pos, edge_labels=sp, font_color="blue", font_size=16)

    plt.show()
else:
    print("Граф задан некорректно")