B"You are given a weighted directed graph, consisting of n vertices and m edges. You should answer q queries of two types: The first line of input data contains integers n, m, q (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n, xe2 x80 x89m xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105, 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89q xe2 x80 x89 xe2 x89 xa4 xe2 x80 x892000) -- the number of vertices and edges in the graph, and the number of requests correspondingly. Next m lines of input data contain the descriptions of edges: i-th of them contains description of edge with index i -- three integers ai, bi, ci (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ai, xe2 x80 x89bi xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n, 0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ci xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109) -- the beginning and the end of edge, and its initial weight correspondingly. Next q lines of input data contain the description of edges in the format described above (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89v xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n, 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89lj xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89m). It's guaranteed that inside single query all lj are distinct. Also, it's guaranteed that a total number of edges in all requests of the second type does not exceed 106. For each query of first type print the length of the shortest path from 1 to v in a separate line. Print -1, if such path does not exists. The description of changes of the graph in the first sample case: The description of changes of the graph in the second sample case: "...