from collections import deque

def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    idx = 0
    n = int(data[idx])
    idx += 1
    m = int(data[idx])
    idx += 1
    
    in_edges = [[] for _ in range(n)]  # in_edges[B] stores tuples of (A, C)
    edges = [[] for _ in range(n)]     # edges[A] stores tuples of (B, C)
    indegree = [0] * n
    
    for _ in range(m):
        a = int(data[idx])
        idx += 1
        b = int(data[idx])
        idx += 1
        c = int(data[idx])
        idx += 1
        in_edges[b].append((a, c))
        edges[a].append((b, c))
        indegree[b] += 1
    
    # Topological sort
    queue = deque()
    for i in range(n):
        if indegree[i] == 0:
            queue.append(i)
    
    order = []
    while queue:
        u = queue.popleft()
        order.append(u)
        for (v, c) in edges[u]:
            indegree[v] -= 1
            if indegree[v] == 0:
                queue.append(v)
    
    # Initialize probabilities
    prob = [0.0] * n
    prob[0] = 1.0  # Group 0 starts with probability 1.0
    
    for b in order:
        if b == 0:
            continue  # Skip group 0, as its probability is fixed
        product = 1.0
        for (a, c) in in_edges[b]:
            if a == 0:
                p_a = 1.0
            else:
                p_a = prob[a]
            product *= (1.0 - p_a * c / 100.0)
        prob[b] = 1.0 - product
    
    print("{0:.10f}".format(prob[n-1]))

if __name__ == "__main__":
    main()