Given a hypergraph with uncertain node weights following known probability distributions, we study the problem of querying as few nodes as possible until the identity of a node with minimum weight can be determined for each hyperedge. Querying a node has a cost and reveals the precise weight of the node, drawn from the given probability distribution. Using competitive analysis, we compare the expected query cost of an algorithm with the expected cost of an optimal query set for the given instance. For the general case, we give a polynomial-time $f(α)$-competitive algorithm, where $f(α)\in [1.618+ε,2]$ depends on the approximation ratio $α$ for an underlying vertex cover problem. We also show that no algorithm using a similar approach can be better than $1.5$-competitive. Furthermore, we give polynomial-time $4/3$-competitive algorithms for bipartite graphs with arbitrary query costs and for hypergraphs with a single hyperedge and uniform query costs, with matching lower bounds.