Wormholes

While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that is BEFORE you entered the wormhole! Each of FJ's farms comprises N (1 ≤ N ≤ 500) fields conveniently numbered 1..N, M (1 ≤ M ≤ 2500) paths, and W (1 ≤ W ≤ 200) wormholes.

As FJ is an avid time-traveling fan, he wants to do the following: start at some field, travel through some paths and wormholes, and return to the starting field a time before his initial departure. Perhaps he will be able to meet himself :) .

To help FJ find out whether this is possible or not, he will supply you with complete maps to F (1 ≤ F ≤ 5) of his farms. No paths will take longer than 10,000 seconds to travel and no wormhole can bring FJ back in time by more than 10,000 seconds.

Input

Line 1: A single integer, F. F farm descriptions follow.
Line 1 of each farm: Three space-separated integers respectively: N, M, and W
Lines 2.. M+1 of each farm: Three space-separated numbers ( S, E, T) that describe, respectively: a bidirectional path between S and E that requires T seconds to traverse. Two fields might be connected by more than one path.
Lines M+2.. M+ W+1 of each farm: Three space-separated numbers ( S, E, T) that describe, respectively: A one way path from S to E that also moves the traveler back T seconds.

Output

Lines 1.. F: For each farm, output "YES" if FJ can achieve his goal, otherwise output "NO" (do not include the quotes).

Sample Input

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

Sample Output

NO
YES

Hint

For farm 1, FJ cannot travel back in time.
For farm 2, FJ could travel back in time by the cycle 1->2->3->1, arriving back at his starting location 1 second before he leaves. He could start from anywhere on the cycle to accomplish this.

挺好玩的一个题，题意就是给你一些双向的边告诉你走这条路的时间，然后给一些单向的边作为捷径（负权边），让你走回到起点的时间小于正常走路的时间。能的话就输出YES否则就输出NO。实际上只是一个判断是否存在负权环的思路，怕你掉到虫洞里出不来。用bellman-ford算法就能解决。

#include<stdio.h>
#include<string.h>
#include<algorithm>
#define inf 0x3f3f3f3f
using namespace std;
int map[1010][1010],n,m,k,sum;
int cn()
{
    int ans=0;
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
        {
            for(int k=1; k<=n; k++)
            {
                if(map[j][k]>map[j][i]+map[i][k])
                    map[j][k]=map[j][i]+map[i][k];
            }

        }
        if(map[i][i]<0)
            return 1;

    }
    return 0;

}
int main()
{
    int w;
    scanf("%d",&w);
    while(w--)
    {
        int a,b,c;
        scanf("%d%d%d",&n,&m,&k);
        memset(map,inf,sizeof(map));
        for(int i=1; i<=n; i++)
            map[i][i]=0;
        for(int i=1; i<=m; i++)
        {
            scanf("%d%d%d",&a,&b,&c);
            if(c<map[a][b])
            {
                map[a][b]=c;
                map[b][a]=c;
            }
        }
        for(int i=1; i<=k; i++)
        {
            scanf("%d%d%d",&a,&b,&c);
            map[a][b]=-c;
        }
        sum=1;
        if(cn())
            printf("YES\n");
        else
            printf("NO\n");
    }
    return 0;
}