3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
struct {
  inline operator int() {
    int x;
    return scanf("%d", &x), x;
  }
  inline operator long long() {
    long long x;
    return scanf("%lld", &x), x;
  }
} read;
const int maxn = 200005;
struct Edge {
  int to, w;
};
std::vector<Edge> G[maxn];
int val[maxn];
bool vis[maxn];
int size[maxn];
int cen, csize;
void get(int u, int n) {
  size[u] = 1;
  int now = 0;
  vis[u] = 1;
  for (Edge e : G[u])
    if (!vis[e.to]) {
      get(e.to, n);
      size[u] += size[e.to];
      now = std::max(now, size[e.to]);
    }
  vis[u] = 0;
  now = std::max(now, n - size[u]);
  if (now < csize) {
    cen = u;
    csize = now;
  }
}
int dis[maxn];
double sq[maxn], sum;
void dfs(int u, int fa) {
  sq[u] = sqrt(dis[u]) * val[u];
  sum += sq[u] * dis[u];
  for (Edge e : G[u])
    if (e.to != fa) {
      dis[e.to] = dis[u] + e.w;
      dfs(e.to, u);
      sq[u] += sq[e.to];
    }
}
double ans = 1e100;
int anspos;
void divi(int s, int n) {
  csize = 1000000000;
  get(s, n);
  int u = cen;
  dis[u] = 0;
  sum = 0;
  dfs(u, 0);
  if (sum < ans) {
    ans = sum;
    anspos = u;
  }
  int to = 0;
  for (Edge e : G[u])
    if (!vis[e.to] and sq[u] - sq[e.to] * 2 < 0) to = e.to;
  if (!to) return;
  vis[u] = 1;
  if (size[to] < size[u])
    divi(to, size[to]);
  else
    divi(to, n - size[u]);
}
int main() {
  int n = read;
  for (int i = 1; i <= n; i++) val[i] = read;
  for (int i = 1; i < n; i++) {
    int u = read, v = read, w = read;
    G[u].push_back({v, w});
    G[v].push_back({u, w});
  }
  divi(1, n);
  printf("%d %.7lf\n", anspos, ans);
}
